{"total":48,"rows":[{"id":"2105.02375","title":"A Geometric Analysis of Neural Collapse with Unconstrained Features","created":"2021-05-06","cited_by_count":227,"area":null},{"id":"2111.12444","title":"Edge Artificial Intelligence for 6G: Vision, Enabling Technologies, and Applications","created":"2021-11-24","cited_by_count":97,"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":"2209.09211","title":"Neural Collapse with Normalized Features: A Geometric Analysis over the Riemannian Manifold","created":"2022-09-19","cited_by_count":50,"area":null},{"id":"2403.03945","title":"SPEAR:Exact Gradient Inversion of Batches in Federated Learning","created":"2024-03-06","cited_by_count":15,"area":null},{"id":"2210.12945","title":"Revisiting Sparse Convolutional Model for Visual Recognition","created":"2022-10-24","cited_by_count":14,"area":null},{"id":"2406.01909","title":"A Global Geometric Analysis of Maximal Coding Rate Reduction","created":"2024-06-04","cited_by_count":13,"area":null},{"id":"2110.04814","title":"Finding Second-Order Stationary Points in Nonconvex-Strongly-Concave Minimax Optimization","created":"2021-10-10","cited_by_count":12,"area":null},{"id":"2504.09708","title":"Preconditioned Gradient Descent for Over-Parameterized Nonconvex Matrix Factorization","created":"2025-04-13","cited_by_count":12,"area":null},{"id":"2106.06338","title":"Understanding approximate and unrolled dictionary learning for pattern recovery","created":"2021-06-11","cited_by_count":11,"area":null},{"id":"2104.11510","title":"Time Series Forecasting via Learning Convolutionally Low-Rank Models","created":"2021-04-23","cited_by_count":10,"area":null},{"id":"2206.02041","title":"First-Order Algorithms for Min-Max Optimization in Geodesic Metric Spaces","created":"2022-06-04","cited_by_count":10,"area":null},{"id":"2212.07534","title":"Decentralized Nonconvex Optimization with Guaranteed Privacy and Accuracy","created":"2022-12-14","cited_by_count":10,"area":null},{"id":"2210.12816","title":"Simple Alternating Minimization Provably Solves Complete Dictionary Learning","created":"2022-10-23","cited_by_count":6,"area":null},{"id":"2212.13597","title":"Optimal Regularization for a Data Source","created":"2022-12-27","cited_by_count":6,"area":null},{"id":"2107.05330","title":"Sparse Personalized Federated Learning","created":"2021-07-12","cited_by_count":5,"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":"2305.15311","title":"Personalized Dictionary Learning for Heterogeneous Datasets","created":"2023-05-24","cited_by_count":5,"area":null},{"id":"2203.13517","title":"Sparse Federated Learning with Hierarchical Personalized Models","created":"2022-03-25","cited_by_count":4,"area":null},{"id":"2209.15130","title":"Nonconvex Matrix Factorization is Geodesically Convex: Global Landscape Analysis for Fixed-rank Matrix Optimization From a Riemannian Perspective","created":"2022-09-29","cited_by_count":4,"area":null},{"id":"2102.00937","title":"Riemannian Perspective on Matrix Factorization","created":"2021-02-01","cited_by_count":3,"area":null},{"id":"2211.02163","title":"A Riemannian ADMM","created":"2022-11-03","cited_by_count":3,"area":null},{"id":"2402.03648","title":"Multilinear Kernel Regression and Imputation via Manifold Learning","created":"2024-02-06","cited_by_count":3,"area":null},{"id":"2409.19422","title":"Identifiable Shared Component Analysis of Unpaired Multimodal Mixtures","created":"2024-09-28","cited_by_count":3,"area":null},{"id":"2510.24200","title":"SPEAR++: Scaling Gradient Inversion via Sparsely-Used Dictionary Learning","created":"2025-10-28","cited_by_count":3,"area":null},{"id":"2201.04822","title":"A Geometric Approach to $k$-means","created":"2022-01-13","cited_by_count":2,"area":null},{"id":"2305.19206","title":"Gradient descent in matrix factorization: Understanding large initialization","created":"2023-05-30","cited_by_count":2,"area":null},{"id":"2306.16617","title":"Last-Iterate Convergence of Adaptive Riemannian Gradient Descent for Equilibrium Computation","created":"2023-06-29","cited_by_count":2,"area":null},{"id":"2310.10545","title":"Optimal vintage factor analysis with deflation varimax","created":"2023-10-16","cited_by_count":2,"area":null},{"id":"2403.10423","title":"Quantization Avoids Saddle Points in Distributed Optimization","created":"2024-03-15","cited_by_count":2,"area":null},{"id":"2403.10547","title":"Robust Second-Order Nonconvex Optimization and Its Application to Low Rank Matrix Sensing","created":"2024-03-12","cited_by_count":2,"area":null},{"id":"2506.20344","title":"A Complete Loss Landscape Analysis of Regularized Deep Matrix Factorization","created":"2025-06-25","cited_by_count":2,"area":null},{"id":"2510.01943","title":"Smooth Quasar-Convex Optimization with Constraints","created":"2025-10-02","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":"2104.04199","title":"A Riemannian smoothing steepest descent method for non-Lipschitz optimization on submanifolds","created":"2021-04-09","cited_by_count":1,"area":null},{"id":"2106.15493","title":"Generalized Orthogonal Procrustes Problem under Arbitrary Adversaries","created":"2021-06-29","cited_by_count":1,"area":null},{"id":"2204.13599","title":"Signal Recovery with Non-Expansive Generative Network Priors","created":"2022-04-24","cited_by_count":1,"area":null},{"id":"2310.18841","title":"A randomized algorithm for nonconvex minimization with inexact evaluations and complexity guarantees","created":"2023-10-28","cited_by_count":1,"area":null},{"id":"2410.06878","title":"Noise is All You Need: Private Second-Order Convergence of Noisy SGD","created":"2024-10-09","cited_by_count":1,"area":null},{"id":"2604.04130","title":"Primal-Dual Methods for Nonsmooth Nonconvex Optimization with Orthogonality Constraints","created":"2026-04-05","cited_by_count":1,"area":null},{"id":"2103.01484","title":"Online Orthogonal Dictionary Learning Based on Frank-Wolfe Method","created":"2021-03-02","cited_by_count":0,"area":null},{"id":"2302.02548","title":"Learning Trees of $\\ell_0$-Minimization Problems","created":"2023-02-06","cited_by_count":0,"area":null},{"id":"2405.07649","title":"Efficient Matrix Factorization Via Householder Reflections","created":"2024-05-13","cited_by_count":0,"area":null},{"id":"2405.14192","title":"IB-AdCSCNet:Adaptive Convolutional Sparse Coding Network Driven by Information Bottleneck","created":"2024-05-23","cited_by_count":0,"area":null},{"id":"2502.06775","title":"Enhancing Performance of Explainable AI Models with Constrained Concept Refinement","created":"2025-02-10","cited_by_count":0,"area":null},{"id":"2506.08428","title":"Sharper Convergence Rates for Nonconvex Optimisation via Reduction Mappings","created":"2025-06-10","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},{"id":"2609.23812","title":"Iterative Atom Refinement: A Monotonicity Principle for Dictionary Learning","created":"2026-09-20","cited_by_count":0,"area":null}],"next_cursor":null}