{"total":30,"rows":[{"id":"2102.02887","title":"Do We Actually Need Dense Over-Parameterization? In-Time Over-Parameterization in Sparse Training","created":"2021-02-04","cited_by_count":110,"area":null},{"id":"2201.08025","title":"Low-Pass Filtering SGD for Recovering Flat Optima in the Deep Learning Optimization Landscape","created":"2022-01-20","cited_by_count":39,"area":null},{"id":"2107.13741","title":"Self-Paced Contrastive Learning for Semi-supervised Medical Image Segmentation with Meta-labels","created":"2021-07-29","cited_by_count":32,"area":null},{"id":"2110.02479","title":"Exponentially Many Local Minima in Quantum Neural Networks","created":"2021-10-06","cited_by_count":22,"area":null},{"id":"2106.00669","title":"Discovering Diverse Nearly Optimal Policies with Successor Features","created":"2021-06-01","cited_by_count":20,"area":null},{"id":"2306.16361","title":"Beyond NTK with Vanilla Gradient Descent: A Mean-Field Analysis of Neural Networks with Polynomial Width, Samples, and Time","created":"2023-06-28","cited_by_count":20,"area":null},{"id":"2305.19510","title":"Mildly Overparameterized ReLU Networks Have a Favorable Loss Landscape","created":"2023-05-31","cited_by_count":17,"area":null},{"id":"2204.10782","title":"On Feature Learning in Neural Networks with Global Convergence Guarantees","created":"2022-04-22","cited_by_count":13,"area":null},{"id":"2103.10922","title":"Landscape analysis for shallow neural networks: complete classification of critical points for affine target functions","created":"2021-03-19","cited_by_count":11,"area":null},{"id":"2402.03625","title":"Convex Relaxations of ReLU Neural Networks Approximate Global Optima in Polynomial Time","created":"2024-02-06","cited_by_count":11,"area":null},{"id":"2404.06391","title":"Exploring Neural Network Landscapes: Star-Shaped and Geodesic Connectivity","created":"2024-04-09","cited_by_count":9,"area":null},{"id":"2103.13462","title":"Why Do Local Methods Solve Nonconvex Problems?","created":"2021-03-24","cited_by_count":8,"area":null},{"id":"2104.05785","title":"A Recipe for Global Convergence Guarantee in Deep Neural Networks","created":"2021-04-12","cited_by_count":8,"area":null},{"id":"2210.12001","title":"When Expressivity Meets Trainability: Fewer than $n$ Neurons Can Work","created":"2022-10-21","cited_by_count":8,"area":null},{"id":"2102.03793","title":"Tilting the playing field: Dynamical loss functions for machine learning","created":"2021-02-07","cited_by_count":7,"area":null},{"id":"2102.13233","title":"Spurious Local Minima Are Common for Deep Neural Networks with Piecewise Linear Activations","created":"2021-02-25","cited_by_count":7,"area":null},{"id":"2402.05626","title":"Loss Landscape of Shallow ReLU-like Neural Networks: Stationary Points, Saddle Escape, and Network Embedding","created":"2024-02-08","cited_by_count":6,"area":null},{"id":"2206.05916","title":"Why Quantization Improves Generalization: NTK of Binary Weight Neural Networks","created":"2022-06-13","cited_by_count":5,"area":null},{"id":"2103.09424","title":"Escaping Saddle Points in Distributed Newton's Method with Communication Efficiency and Byzantine Resilience","created":"2021-03-17","cited_by_count":3,"area":null},{"id":"2306.09778","title":"Gradient is All You Need? How Consensus-Based Optimization can be Interpreted as a Stochastic Relaxation of Gradient Descent","created":"2023-06-16","cited_by_count":3,"area":null},{"id":"2506.14951","title":"Flat Channels to Infinity in Neural Loss Landscapes","created":"2025-06-17","cited_by_count":3,"area":null},{"id":"2510.18435","title":"Overparametrization bends the landscape: BBP transitions at initialization in simple Neural Networks","created":"2025-10-21","cited_by_count":2,"area":null},{"id":"2101.08310","title":"Non-Convex Compressed Sensing with Training Data","created":"2021-01-20","cited_by_count":1,"area":null},{"id":"2602.17779","title":"Topological Exploration of High-Dimensional Empirical Risk Landscapes: general approach, and applications to phase retrieval","created":"2026-02-19","cited_by_count":1,"area":null},{"id":"2104.01730","title":"Training Deep Neural Networks via Branch-and-Bound","created":"2021-04-05","cited_by_count":0,"area":null},{"id":"2306.14817","title":"Black holes and the loss landscape in machine learning","created":"2023-06-26","cited_by_count":0,"area":null},{"id":"2410.08041","title":"On the Convergence of (Stochastic) Gradient Descent for Kolmogorov--Arnold Networks","created":"2024-10-10","cited_by_count":0,"area":null},{"id":"2410.10690","title":"Dynamical loss functions shape landscape topography and improve learning in artificial neural networks","created":"2024-10-14","cited_by_count":0,"area":null},{"id":"2602.22107","title":"Don't stop me now: How Validation Criteria Affect Checkpoint Selection and Early Stopping","created":"2026-02-25","cited_by_count":0,"area":null},{"id":"2610.15299","title":"WisdomNet: trustable machine learning toward error-free classification","created":"2026-10-11","cited_by_count":0,"area":null}],"next_cursor":null}