{"total":35,"rows":[{"id":"2202.01017","title":"Multi-Task Learning as a Bargaining Game","created":"2022-02-02","cited_by_count":215,"area":null},{"id":"2205.10330","title":"A Review of Safe Reinforcement Learning: Methods, Theory and Applications","created":"2022-05-20","cited_by_count":181,"area":null},{"id":"2110.02796","title":"An Unconstrained Layer-Peeled Perspective on Neural Collapse","created":"2021-10-06","cited_by_count":87,"area":null},{"id":"2108.02040","title":"Convergence of gradient descent for learning linear neural networks","created":"2021-08-04","cited_by_count":22,"area":null},{"id":"2212.05727","title":"Evaluating Model-free Reinforcement Learning toward Safety-critical Tasks","created":"2022-12-12","cited_by_count":22,"area":null},{"id":"2106.01429","title":"Smooth Bilevel Programming for Sparse Regularization","created":"2021-06-02","cited_by_count":14,"area":null},{"id":"2112.09684","title":"On the existence of global minima and convergence analyses for gradient descent methods in the training of deep neural networks","created":"2021-12-17","cited_by_count":12,"area":null},{"id":"2108.04620","title":"A proof of convergence for the gradient descent optimization method with random initializations in the training of neural networks with ReLU activation for piecewise linear target functions","created":"2021-08-10","cited_by_count":10,"area":null},{"id":"2104.00277","title":"A proof of convergence for stochastic gradient descent in the training of artificial neural networks with ReLU activation for constant target functions","created":"2021-04-01","cited_by_count":9,"area":null},{"id":"2112.07369","title":"Convergence proof for stochastic gradient descent in the training of deep neural networks with ReLU activation for constant target functions","created":"2021-12-13","cited_by_count":9,"area":null},{"id":"2101.05248","title":"Solving Min-Max Optimization with Hidden Structure via Gradient Descent Ascent","created":"2021-01-13","cited_by_count":8,"area":null},{"id":"2311.02374","title":"Riemannian stochastic optimization methods avoid strict saddle points","created":"2023-11-04","cited_by_count":8,"area":null},{"id":"2306.11922","title":"No Wrong Turns: The Simple Geometry Of Neural Networks Optimization Paths","created":"2023-06-20","cited_by_count":7,"area":null},{"id":"2306.14522","title":"Nonconvex Stochastic Bregman Proximal Gradient Method with Application to Deep Learning","created":"2023-06-26","cited_by_count":7,"area":null},{"id":"2406.07029","title":"Fairness-Aware Meta-Learning via Nash Bargaining","created":"2024-06-11","cited_by_count":6,"area":null},{"id":"2208.02083","title":"Gradient descent provably escapes saddle points in the training of shallow ReLU networks","created":"2022-08-03","cited_by_count":5,"area":null},{"id":"2210.00346","title":"Behind the Scenes of Gradient Descent: A Trajectory Analysis via Basis Function Decomposition","created":"2022-10-01","cited_by_count":4,"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":"2502.06525","title":"Towards Understanding Gradient Dynamics of the Sliced-Wasserstein Distance via Critical Point Analysis","created":"2025-02-10","cited_by_count":3,"area":null},{"id":"2507.15264","title":"On exploration of an interior mirror descent flow for stochastic nonconvex constrained problem","created":"2025-07-21","cited_by_count":3,"area":null},{"id":"2111.04596","title":"Inertial Newton Algorithms Avoiding Strict Saddle Points","created":"2021-11-08","cited_by_count":2,"area":null},{"id":"2302.07862","title":"Almost Sure Saddle Avoidance of Stochastic Gradient Methods without the Bounded Gradient Assumption","created":"2023-02-15","cited_by_count":1,"area":null},{"id":"2401.09274","title":"Avoiding strict saddle points of nonconvex regularized problems","created":"2024-01-17","cited_by_count":1,"area":null},{"id":"2101.02625","title":"Boundary Conditions for Linear Exit Time Gradient Trajectories Around Saddle Points: Analysis and Algorithm","created":"2021-01-07","cited_by_count":0,"area":null},{"id":"2107.09207","title":"Asymptotic Escape of Spurious Critical Points on the Low-rank Matrix Manifold","created":"2021-07-20","cited_by_count":0,"area":null},{"id":"2109.03974","title":"Constants of Motion: The Antidote to Chaos in Optimization and Game Dynamics","created":"2021-09-08","cited_by_count":0,"area":null},{"id":"2204.11407","title":"Accelerated Multiplicative Weights Update Avoids Saddle Points almost always","created":"2022-04-25","cited_by_count":0,"area":null},{"id":"2404.16505","title":"Efficient algorithms for regularized Poisson Non-negative Matrix Factorization","created":"2024-04-25","cited_by_count":0,"area":null},{"id":"2405.13787","title":"Disentangle Sample Size and Initialization Effect on Perfect Generalization for Single-Neuron Target","created":"2024-05-22","cited_by_count":0,"area":null},{"id":"2502.19210","title":"Langevin Multiplicative Weights Update with Applications in Polynomial Portfolio Management","created":"2025-02-26","cited_by_count":0,"area":null},{"id":"2510.19382","title":"A Derandomization Framework for Structure Discovery: Applications in Neural Networks and Beyond","created":"2025-10-22","cited_by_count":0,"area":null},{"id":"2510.24466","title":"Non-Singularity of the Gradient Descent map for Neural Networks with Piecewise Analytic Activations","created":"2025-10-28","cited_by_count":0,"area":null},{"id":"2606.28307","title":"Second-Order KKT Guarantees for Bregman ADMM in Nonconvex and Non-Lipschitz Optimization","created":"2026-06-26","cited_by_count":0,"area":null},{"id":"2606.30333","title":"Local-Minima-Preserving Continuous Relaxation of Ising Problems","created":"2026-06-29","cited_by_count":0,"area":null},{"id":"2608.03001","title":"Stochastic Saddle Avoidance Beyond Unit Excitation and Smoothness: A Pathwise Lyapunov-Perron Framework","created":"2026-08-04","cited_by_count":0,"area":null}],"next_cursor":null}