Mathematics & Optimization

Fair and Efficient Completion of Indivisible Goods AAAI 2025 Fair Clustering via Alignment ICML 2025 Fair Division via the Cake-Cutting Share AAAI 2025 Fair Division with Market Values AAAI 2025 Fairness Overfitting in Machine Learning: An Information-Theoretic Perspective ICML 2025 Fairness Shields: Safeguarding against Biased Decision Makers AAAI 2025 Fair Submodular Cover ICLR 2025 Fair Submodular Maximization over a Knapsack Constraint IJCAI 2025 Fast Algorithm for Constrained Linear Inverse Problems JMLR 2025 Fast and Furious Symmetric Learning in Zero-Sum Games: Gradient Descent as Fictitious Play COLT 2025 Fast and Interpretable Mixed-Integer Linear Program Solving by Learning Model Reduction AAAI 2025 Fast and Provable Algorithms for Sparse PCA with Improved Sample Complexity ICML 2025 Fast and Stronger Lower Bounds for Planar Euclidean Shortest Paths IJCAI 2025 Fast Bayesian Optimization of Function Networks with Partial Evaluations AutoML 2025 Fast Computation of Superquantile-Constrained Optimization Through Implicit Scenario Reduction JMLR 2025 Fast Computing of Dung Semantics in Acyclic Probabilistic Argumentation Frameworks AAAI 2025 Fast Contiguous Somatic Hypermutations for Single-Objective Optimisation and Multi-Objective Optimisation Via Decomposition AAAI 2025 Fast Convergence of $Φ$-Divergence Along the Unadjusted Langevin Algorithm and Proximal Sampler ALT 2025 Faster Acceleration for Steepest Descent COLT 2025 Faster Algorithms for Agnostically Learning Disjunctions and their Implications COLT 2025 Faster Approximation Algorithms for k-Center via Data Reduction ICML 2025 Faster Convergence of Riemannian Stochastic Gradient Descent with Increasing Batch Size ACML 2025 Faster Double Adaptive Gradient Methods AAAI 2025 Faster Global Minimum Cut with Predictions ICML 2025 Faster Low-Rank Approximation and Kernel Ridge Regression via the Block-Nyström Method COLT 2025