{"total":100,"rows":[{"id":"2306.14048","title":"H$_2$O: Heavy-Hitter Oracle for Efficient Generative Inference of Large Language Models","created":"2023-06-24","cited_by_count":832,"area":"inference"},{"id":"2112.00059","title":"Evaluating Gradient Inversion Attacks and Defenses in Federated Learning","created":"2021-11-30","cited_by_count":196,"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":"2304.10411","title":"Attention Scheme Inspired Softmax Regression","created":"2023-04-20","cited_by_count":49,"area":null},{"id":"2303.15725","title":"Solving Regularized Exp, Cosh and Sinh Regression Problems","created":"2023-03-28","cited_by_count":44,"area":null},{"id":"2304.04397","title":"Randomized and Deterministic Attention Sparsification Algorithms for Over-parameterized Feature Dimension","created":"2023-04-10","cited_by_count":37,"area":null},{"id":"2412.12444","title":"LazyDiT: Lazy Learning for the Acceleration of Diffusion Transformers","created":"2024-12-17","cited_by_count":37,"area":"diffusion"},{"id":"2305.00660","title":"An Iterative Algorithm for Rescaled Hyperbolic Functions Regression","created":"2023-05-01","cited_by_count":35,"area":null},{"id":"2110.04622","title":"Does Preprocessing Help Training Over-parameterized Neural Networks?","created":"2021-10-09","cited_by_count":32,"area":null},{"id":"2306.04933","title":"InfoPrompt: Information-Theoretic Soft Prompt Tuning for Natural Language Understanding","created":"2023-06-08","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":"2211.14227","title":"Bypass Exponential Time Preprocessing: Fast Neural Network Training via Weight-Data Correlation Preprocessing","created":"2022-11-25","cited_by_count":29,"area":null},{"id":"2306.02295","title":"A Mathematical Abstraction for Balancing the Trade-off Between Creativity and Reality in Large Language Models","created":"2023-06-04","cited_by_count":29,"area":null},{"id":"2305.04701","title":"Differentially Private Attention Computation","created":"2023-05-08","cited_by_count":25,"area":null},{"id":"2308.10502","title":"GradientCoin: A Peer-to-Peer Decentralized Large Language Models","created":"2023-08-21","cited_by_count":23,"area":null},{"id":"2208.05395","title":"A Sublinear Adversarial Training Algorithm","created":"2022-08-10","cited_by_count":22,"area":null},{"id":"2112.04137","title":"Pareto Domain Adaptation","created":"2021-12-08","cited_by_count":20,"area":null},{"id":"2209.08554","title":"Pruning Neural Networks via Coresets and Convex Geometry: Towards No Assumptions","created":"2022-09-18","cited_by_count":20,"area":null},{"id":"2308.14304","title":"Solving Attention Kernel Regression Problem via Pre-conditioner","created":"2023-08-28","cited_by_count":20,"area":null},{"id":"2111.15139","title":"Breaking the Linear Iteration Cost Barrier for Some Well-known Conditional Gradient Methods Using MaxIP Data-structures","created":"2021-11-30","cited_by_count":19,"area":null},{"id":"2408.12151","title":"A Tighter Complexity Analysis of SparseGPT","created":"2024-08-22","cited_by_count":19,"area":null},{"id":"2208.03635","title":"Federated Adversarial Learning: A Framework with Convergence Analysis","created":"2022-08-07","cited_by_count":17,"area":null},{"id":"2105.08285","title":"Sublinear Least-Squares Value Iteration via Locality Sensitive Hashing","created":"2021-05-18","cited_by_count":15,"area":null},{"id":"2110.03743","title":"Reinforcement Learning in Reward-Mixing MDPs","created":"2021-10-07","cited_by_count":15,"area":"alignment"},{"id":"2303.12298","title":"A General Algorithm for Solving Rank-one Matrix Sensing","created":"2023-03-22","cited_by_count":15,"area":null},{"id":"2406.01234","title":"Achieving Tractable Minimax Optimal Regret in Average Reward MDPs","created":"2024-06-03","cited_by_count":15,"area":null},{"id":"2212.11408","title":"Adaptive and Dynamic Multi-Resolution Hashing for Pairwise Summations","created":"2022-12-21","cited_by_count":14,"area":null},{"id":"2302.00248","title":"A Nearly-Optimal Bound for Fast Regression with $\\ell_\\infty$ Guarantee","created":"2023-02-01","cited_by_count":14,"area":null},{"id":"2210.08238","title":"Near-Optimal Regret Bounds for Multi-batch Reinforcement Learning","created":"2022-10-15","cited_by_count":13,"area":"offlinerl"},{"id":"2312.08893","title":"Solving Dense Linear Systems Faster Than via Preconditioning","created":"2023-12-14","cited_by_count":12,"area":null},{"id":"2305.08367","title":"Toward Highly Efficient and Private Submodular Maximization via Matrix-Based Acceleration","created":"2023-05-15","cited_by_count":11,"area":null},{"id":"2309.00203","title":"Generalization Bound and Learning Methods for Data-Driven Projections in Linear Programming","created":"2023-09-01","cited_by_count":10,"area":null},{"id":"2402.09492","title":"PMGDA: A Preference-based Multiple Gradient Descent Algorithm","created":"2024-02-14","cited_by_count":10,"area":"deeprl"},{"id":"2402.13187","title":"Testing Calibration in Nearly-Linear Time","created":"2024-02-20","cited_by_count":10,"area":null},{"id":"2305.17482","title":"Federated Empirical Risk Minimization via Second-Order Method","created":"2023-05-27","cited_by_count":9,"area":null},{"id":"2306.02556","title":"Improved Active Multi-Task Representation Learning via Lasso","created":"2023-06-05","cited_by_count":9,"area":null},{"id":"2306.04169","title":"Efficient Alternating Minimization with Applications to Weighted Low Rank Approximation","created":"2023-06-07","cited_by_count":9,"area":null},{"id":"2306.12594","title":"State-wise Constrained Policy Optimization","created":"2023-06-21","cited_by_count":9,"area":null},{"id":"2501.14349","title":"Online Inverse Linear Optimization: Efficient Logarithmic-Regret Algorithm, Robustness to Suboptimality, and Lower Bound","created":"2025-01-24","cited_by_count":9,"area":null},{"id":"2502.00690","title":"Dissecting Submission Limit in Desk-Rejections: A Mathematical Analysis of Fairness in AI Conference Policies","created":"2025-02-02","cited_by_count":9,"area":null},{"id":"2304.06594","title":"Solving Tensor Low Cycle Rank Approximation","created":"2023-04-13","cited_by_count":8,"area":null},{"id":"2306.00406","title":"Faster Robust Tensor Power Method for Arbitrary Order","created":"2023-06-01","cited_by_count":8,"area":null},{"id":"2405.12952","title":"Truncated Variance Reduced Value Iteration","created":"2024-05-21","cited_by_count":8,"area":null},{"id":"2102.10773","title":"Slowly Varying Regression under Sparsity","created":"2021-02-22","cited_by_count":7,"area":null},{"id":"2305.08353","title":"Fast and Efficient Matching Algorithm with Deadline Instances","created":"2023-05-15","cited_by_count":7,"area":null},{"id":"2408.06395","title":"Fast John Ellipsoid Computation with Differential Privacy Optimization","created":"2024-08-12","cited_by_count":7,"area":null},{"id":"2109.08934","title":"Fairness Maximization among Offline Agents in Online-Matching Markets","created":"2021-09-18","cited_by_count":6,"area":null},{"id":"2209.00652","title":"Towards Optimization and Model Selection for Domain Generalization: A Mixup-guided Solution","created":"2022-09-01","cited_by_count":6,"area":null},{"id":"2304.14197","title":"Logarithmic-Regret Quantum Learning Algorithms for Zero-Sum Games","created":"2023-04-27","cited_by_count":6,"area":null},{"id":"2308.08358","title":"Convergence of Two-Layer Regression with Nonlinear Units","created":"2023-08-16","cited_by_count":6,"area":null},{"id":"2104.03180","title":"Adversarial Robustness Guarantees for Gaussian Processes","created":"2021-04-07","cited_by_count":5,"area":null},{"id":"2305.08001","title":"Structured and Fast Optimization: The Kronecker SGD Algorithm","created":"2023-05-13","cited_by_count":5,"area":null},{"id":"2306.02971","title":"Online Learning with Feedback Graphs: The True Shape of Regret","created":"2023-06-05","cited_by_count":5,"area":null},{"id":"2107.05187","title":"Polynomial Time Reinforcement Learning in Factored State MDPs with Linear Value Functions","created":"2021-07-12","cited_by_count":4,"area":null},{"id":"2107.08090","title":"Near-Optimal Algorithms for Linear Algebra in the Current Matrix Multiplication Time","created":"2021-07-16","cited_by_count":4,"area":null},{"id":"2205.02771","title":"Finding Bipartite Components in Hypergraphs","created":"2022-05-05","cited_by_count":4,"area":null},{"id":"2211.15118","title":"A Faster $k$-means++ Algorithm","created":"2022-11-28","cited_by_count":4,"area":null},{"id":"2306.11121","title":"Projection-Free Online Convex Optimization via Efficient Newton Iterations","created":"2023-06-19","cited_by_count":4,"area":null},{"id":"2311.18138","title":"Algorithmic Persuasion Through Simulation","created":"2023-11-29","cited_by_count":4,"area":null},{"id":"2405.05865","title":"Faster Linear Systems and Matrix Norm Approximation via Multi-level Sketched Preconditioning","created":"2024-05-09","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":"2201.00228","title":"The Complexity of Dynamic Least-Squares Regression","created":"2022-01-01","cited_by_count":3,"area":null},{"id":"2307.06723","title":"Breaking 3-Factor Approximation for Correlation Clustering in Polylogarithmic Rounds","created":"2023-07-13","cited_by_count":3,"area":null},{"id":"2311.10886","title":"A Whole New Ball Game: A Primal Accelerated Method for Matrix Games and Minimizing the Maximum of Smooth Functions","created":"2023-11-17","cited_by_count":3,"area":null},{"id":"2411.08791","title":"Locally Private Sampling with Public Data","created":"2024-11-13","cited_by_count":3,"area":null},{"id":"2502.16912","title":"When Can We Solve the Weighted Low Rank Approximation Problem in Truly Subquadratic Time?","created":"2025-02-24","cited_by_count":3,"area":null},{"id":"2104.05182","title":"Automated Mechanism Design for Classification with Partial Verification","created":"2021-04-12","cited_by_count":2,"area":null},{"id":"2301.03785","title":"Best Arm Identification in Stochastic Bandits: Beyond $\\beta-$optimality","created":"2023-01-10","cited_by_count":2,"area":null},{"id":"2504.12778","title":"Towards Lossless Token Pruning in Late-Interaction Retrieval Models","created":"2025-04-17","cited_by_count":2,"area":"inference"},{"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":"2208.05363","title":"Learning Two-Player Mixture Markov Games: Kernel Function Approximation and Correlated Equilibrium","created":"2022-08-10","cited_by_count":1,"area":null},{"id":"2211.14531","title":"Equity Promotion in Public Transportation","created":"2022-11-26","cited_by_count":1,"area":null},{"id":"2303.06654","title":"Twice Regularized Markov Decision Processes: The Equivalence between Robustness and Regularization","created":"2023-03-12","cited_by_count":1,"area":null},{"id":"2309.17016","title":"Efficient Agnostic Learning with Average Smoothness","created":"2023-09-29","cited_by_count":1,"area":null},{"id":"2402.07437","title":"Learning Optimal Tax Design in Nonatomic Congestion Games","created":"2024-02-12","cited_by_count":1,"area":null},{"id":"2405.04344","title":"Enhancing Scalability of Metric Differential Privacy via Secret Dataset Partitioning and Benders Decomposition","created":"2024-05-07","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":"2409.04320","title":"Faster Sampling from Log-Concave Densities over Polytopes via Efficient Linear Solvers","created":"2024-09-06","cited_by_count":1,"area":null},{"id":"2412.03332","title":"On Approximability of $\\ell_2^2$ Min-Sum Clustering","created":"2024-12-04","cited_by_count":1,"area":null},{"id":"2501.03865","title":"Truthful mechanisms for linear bandit games with private contexts","created":"2025-01-07","cited_by_count":1,"area":null},{"id":"2506.20141","title":"Accept More, Reject Less: Reducing up to 19% Unnecessary Desk-Rejections over 11 Years of ICLR Data","created":"2025-06-25","cited_by_count":1,"area":null},{"id":"2510.03678","title":"Towards Sampling Data Structures for Tensor Products in Turnstile Streams","created":"2025-10-04","cited_by_count":1,"area":null},{"id":"2602.02505","title":"Learning-augmented smooth integer programs with PAC-learnable oracles","created":"2026-01-22","cited_by_count":1,"area":null},{"id":"2106.08544","title":"Non-PSD Matrix Sketching with Applications to Regression and Optimization","created":"2021-06-16","cited_by_count":0,"area":null},{"id":"2112.06225","title":"Approximation algorithms for confidence bands for time series","created":"2021-12-12","cited_by_count":0,"area":null},{"id":"2306.04004","title":"Randomized Schur Complement Views for Graph Contrastive Learning","created":"2023-06-06","cited_by_count":0,"area":null},{"id":"2310.08066","title":"The Search-and-Mix Paradigm in Approximate Nash Equilibrium Algorithms","created":"2023-10-12","cited_by_count":0,"area":null},{"id":"2311.04158","title":"Computing Approximate $\\ell_p$ Sensitivities","created":"2023-11-07","cited_by_count":0,"area":null},{"id":"2311.11429","title":"Fast Heavy Inner Product Identification Between Weights and Inputs in Neural Network Training","created":"2023-11-19","cited_by_count":0,"area":null},{"id":"2312.03218","title":"Accelerated Gradient Algorithms with Adaptive Subspace Search for Instance-Faster Optimization","created":"2023-12-06","cited_by_count":0,"area":null},{"id":"2312.07043","title":"The Complexity of Envy-Free Graph Cutting","created":"2023-12-12","cited_by_count":0,"area":null},{"id":"2403.18142","title":"HERTA: A High-Efficiency and Rigorous Training Algorithm for Unfolded Graph Neural Networks","created":"2024-03-26","cited_by_count":0,"area":null},{"id":"2404.16131","title":"Combinatorial Approximations for Cluster Deletion: Simpler, Faster, and Better","created":"2024-04-24","cited_by_count":0,"area":null},{"id":"2407.00032","title":"Design a Win-Win Strategy That Is Fair to Both Service Providers and Tasks When Rejection Is Not an Option","created":"2024-05-22","cited_by_count":0,"area":null},{"id":"2412.06168","title":"Out-of-Distribution Detection with Overlap Index","created":"2024-12-09","cited_by_count":0,"area":null},{"id":"2508.04953","title":"Tesserae: Scalable Placement Policies for Deep Learning Workloads","created":"2025-08-07","cited_by_count":0,"area":null},{"id":"2509.13934","title":"Large Language Model-Empowered Decision Transformer for UAV-Enabled Data Collection","created":"2025-09-17","cited_by_count":0,"area":"offlinerl"},{"id":"2512.17950","title":"Which Coauthor Should I Nominate in My 99 ICLR Submissions? A Mathematical Analysis of the ICLR 2026 Reciprocal Reviewer Nomination Policy","created":"2025-12-17","cited_by_count":0,"area":null},{"id":"2605.06900","title":"Accelerated Relax-and-Round for Concave Coverage Problems","created":"2026-05-07","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}],"next_cursor":null}