algorithmic efficiency
A measure of how effectively an algorithm utilizes resources such as time and memory to achieve its objectives, impacting scalability and feasibility.
- A Novel General Framework for Sharp Lower Bounds in Succinct Stochastic Bandits
- Accelerated Evolving Set Processes for Local PageRank Computation
- Active Seriation: Efficient Ordering Recovery with Statistical Guarantees
- Algorithms and SQ Lower Bounds for Robustly Learning Real-valued Multi-Index Models
- Approximately Aligned Decoding
- Balancing Gradient and Hessian Queries in Non-Convex Optimization
- Improved Robust Estimation for Erdős-Rényi Graphs: The Sparse Regime and Optimal Breakdown Point
- Multimodal Bandits: Regret Lower Bounds and Optimal Algorithms
- Nearly-Linear Time and Massively Parallel Algorithms for $k$-anonymity
- Non-monotone Submodular Optimization: $p$-Matchoid Constraints and Fully Dynamic Setting
- Optimal Dynamic Regret by Transformers for Non-Stationary Reinforcement Learning
- Put CASH on Bandits: A Max K-Armed Problem for Automated Machine Learning
- The Generative Leap: Tight Sample Complexity for Efficiently Learning Gaussian Multi-Index Models
- The Good, the Bad and the Ugly: Meta-Analysis of Watermarks, Transferable Attacks and Adversarial Defenses