{"total":50,"rows":[{"id":"2105.02276","title":"Training Quantum Embedding Kernels on Near-Term Quantum Computers","created":"2021-05-05","cited_by_count":69,"area":null},{"id":"2112.07628","title":"Training Multi-Layer Over-Parametrized Neural Network in Subquadratic Time","created":"2021-12-14","cited_by_count":62,"area":null},{"id":"2202.00132","title":"Submodularity In Machine Learning and Artificial Intelligence","created":"2022-01-31","cited_by_count":38,"area":null},{"id":"2111.05818","title":"Efficient Projection-Free Online Convex Optimization with Membership Oracle","created":"2021-11-10","cited_by_count":30,"area":null},{"id":"2309.07418","title":"A Fast Optimization View: Reformulating Single Layer Attention in LLM Based on Tensor and SVM Trick, and Solving It in Matrix Multiplication Time","created":"2023-09-14","cited_by_count":30,"area":null},{"id":"2205.09961","title":"Discrete-Convex-Analysis-Based Framework for Warm-Starting Algorithms with Predictions","created":"2022-05-20","cited_by_count":16,"area":null},{"id":"2303.12298","title":"A General Algorithm for Solving Rank-one Matrix Sensing","created":"2023-03-22","cited_by_count":15,"area":null},{"id":"2203.15260","title":"Efficient Convex Optimization Requires Superlinear Memory","created":"2022-03-29","cited_by_count":14,"area":null},{"id":"2103.00564","title":"An Introduction to Johnson-Lindenstrauss Transforms","created":"2021-02-28","cited_by_count":11,"area":null},{"id":"2205.11470","title":"Exploiting the Curvature of Feasible Sets for Faster Projection-Free Online Learning","created":"2022-05-23","cited_by_count":10,"area":null},{"id":"2106.01488","title":"Minimax Optimization with Smooth Algorithmic Adversaries","created":"2021-06-02","cited_by_count":8,"area":null},{"id":"2303.14467","title":"A Survey on the Densest Subgraph Problem and Its Variants","created":"2023-03-25","cited_by_count":8,"area":null},{"id":"2305.16903","title":"Submodular Minimax Optimization: Finding Effective Sets","created":"2023-05-26","cited_by_count":7,"area":null},{"id":"2305.16892","title":"Feature Adaptation for Sparse Linear Regression","created":"2023-05-26","cited_by_count":6,"area":null},{"id":"2302.04963","title":"Quadratic Memory is Necessary for Optimal Query Complexity in Convex Optimization: Center-of-Mass is Pareto-Optimal","created":"2023-02-09","cited_by_count":5,"area":null},{"id":"2403.17868","title":"An invitation to the sample complexity of quantum hypothesis testing","created":"2024-03-26","cited_by_count":5,"area":null},{"id":"2304.02700","title":"Agnostic proper learning of monotone functions: beyond the black-box correction barrier","created":"2023-04-05","cited_by_count":4,"area":null},{"id":"2306.02212","title":"Accelerated Quasi-Newton Proximal Extragradient: Faster Rate for Smooth Convex Optimization","created":"2023-06-03","cited_by_count":4,"area":null},{"id":"2306.12534","title":"Memory-Query Tradeoffs for Randomized Convex Optimization","created":"2023-06-21","cited_by_count":4,"area":null},{"id":"2410.17336","title":"Computing Optimal Regularizers for Online Linear Optimization","created":"2024-10-22","cited_by_count":4,"area":null},{"id":"2502.21240","title":"The Structural Complexity of Matrix-Vector Multiplication","created":"2025-02-28","cited_by_count":4,"area":null},{"id":"2103.03868","title":"Decomposable Submodular Function Minimization via Maximum Flow","created":"2021-03-05","cited_by_count":3,"area":null},{"id":"2302.00928","title":"Rethinking Warm-Starts with Predictions: Learning Predictions Close to Sets of Optimal Solutions for Faster $\\text{L}$-/$\\text{L}^\\natural$-Convex Function Minimization","created":"2023-02-02","cited_by_count":3,"area":null},{"id":"2306.05865","title":"Faster Discrete Convex Function Minimization with Predictions: The M-Convex Case","created":"2023-06-09","cited_by_count":3,"area":null},{"id":"2306.10096","title":"Memory-Constrained Algorithms for Convex Optimization via Recursive Cutting-Planes","created":"2023-06-16","cited_by_count":3,"area":null},{"id":"2406.07373","title":"Closing the Computational-Query Depth Gap in Parallel Stochastic Convex Optimization","created":"2024-06-11","cited_by_count":3,"area":null},{"id":"2406.07407","title":"Private Geometric Median","created":"2024-06-11","cited_by_count":3,"area":null},{"id":"2512.23190","title":"A Simple, Optimal and Efficient Algorithm for Online Exp-Concave Optimization","created":"2025-12-29","cited_by_count":3,"area":null},{"id":"2609.13440","title":"Efficient Online Inverse Optimization with $O(d)$ Regret","created":"2026-09-11","cited_by_count":3,"area":null},{"id":"2507.04438","title":"Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities","created":"2025-07-06","cited_by_count":2,"area":null},{"id":"2103.01061","title":"A Hybrid Quantum-Classical Hamiltonian Learning Algorithm","created":"2021-03-01","cited_by_count":1,"area":null},{"id":"2204.07879","title":"Polynomial-time Sparse Measure Recovery: From Mean Field Theory to Algorithm Design","created":"2022-04-16","cited_by_count":1,"area":null},{"id":"2205.07217","title":"Online Nonsubmodular Minimization with Delayed Costs: From Full Information to Bandit Feedback","created":"2022-05-15","cited_by_count":1,"area":null},{"id":"2402.07027","title":"Quantum Speedup for Spectral Approximation of Kronecker Products","created":"2024-02-10","cited_by_count":1,"area":null},{"id":"2404.06720","title":"Gradient Descent is Pareto-Optimal in the Oracle Complexity and Memory Tradeoff for Feasibility Problems","created":"2024-04-10","cited_by_count":1,"area":null},{"id":"2405.06003","title":"Binary Hypothesis Testing for Softmax Models and Leverage Score Models","created":"2024-05-09","cited_by_count":1,"area":null},{"id":"2405.14090","title":"Solving 0-1 Integer Programs with Unknown Knapsack Constraints Using Membership Oracles","created":"2024-05-23","cited_by_count":1,"area":null},{"id":"2410.02145","title":"Active Learning of Deep Neural Networks via Gradient-Free Cutting Planes","created":"2024-10-03","cited_by_count":1,"area":null},{"id":"2501.03222","title":"Characterizing the Accuracy-Communication-Privacy Trade-off in Distributed Stochastic Convex Optimization","created":"2025-01-06","cited_by_count":1,"area":null},{"id":"2506.12994","title":"Differentially Private Bilevel Optimization: Efficient Algorithms with Near-Optimal Rates","created":"2025-06-15","cited_by_count":1,"area":null},{"id":"2507.14835","title":"Differentially Private Synthetic Graphs Preserving Triangle-Motif Cuts","created":"2025-07-20","cited_by_count":1,"area":null},{"id":"2106.09350","title":"Identifiability of AMP chain graph models","created":"2021-06-17","cited_by_count":0,"area":null},{"id":"2208.03811","title":"Decomposable Non-Smooth Convex Optimization with Nearly-Linear Gradient Oracle Complexity","created":"2022-08-07","cited_by_count":0,"area":null},{"id":"2410.08578","title":"Logarithmic Regret for Unconstrained Submodular Maximization Stochastic Bandit","created":"2024-10-11","cited_by_count":0,"area":null},{"id":"2412.07441","title":"Reconstructing Deep Neural Networks: Unleashing the Optimization Potential of Natural Gradient Descent","created":"2024-12-10","cited_by_count":0,"area":null},{"id":"2503.17308","title":"On Quantum Perceptron Learning via Quantum Search","created":"2025-03-21","cited_by_count":0,"area":null},{"id":"2605.00201","title":"Matroid Algorithms Under Size-Sensitive Independence Oracles","created":"2026-04-30","cited_by_count":0,"area":null},{"id":"2606.20082","title":"Beyond Averaging in John Ellipsoid Approximation: High-Accuracy Algorithms in the Leverage-Score Model","created":"2026-06-18","cited_by_count":0,"area":null},{"id":"2607.04062","title":"Fast, Parallel, Query-Efficient Binary Classification","created":"2026-07-05","cited_by_count":0,"area":null},{"id":"2607.24827","title":"Stronger Memory-Query Tradeoffs for Convex Optimization: The Limitations of Subquadratic Memory","created":"2026-07-21","cited_by_count":0,"area":null}],"next_cursor":null}