Mathematics & Optimization

Better Understandings and Configurations in MaxSAT Stochastic Local Search Solvers via Anytime Performance Analysis AAAI 2025 Beyond cognacy ACL 2025 Beyond Discretization: Learning the Optimal Solution Path AISTATS 2025 Beyond Individual and Point: Next POI Recommendation via Region-aware Dynamic Hypergraph with Dual-level Modeling IJCAI 2025 Beyond Low-rankness: Guaranteed Matrix Recovery via Modified Nuclear Norm IJCAI 2025 Beyond Mandatory Federations: Balancing Egoism, Utilitarianism and Egalitarianism in Mixed-Motive Games AAAI 2025 Beyond Minimax Rates in Group Distributionally Robust Optimization via a Novel Notion of Sparsity ICML 2025 Beyond Monotonicity: On the Convergence of Learning Algorithms in Standard Auction Games AAAI 2025 Beyond propagation of chaos: A stochastic algorithm for mean field optimization COLT 2025 Beyond Self-Interest: How Group Strategies Reshape Content Creation in Recommendation Platforms? ICML 2025 Beyond Self-Repellent Kernels: History-Driven Target Towards Efficient Nonlinear MCMC on General Graphs ICML 2025 Beyond Sin-Squared Error: Linear Time Entrywise Uncertainty Quantification for Streaming PCA UAI 2025 Beyond Size-Based Metrics: Measuring Task-Specific Complexity in Symbolic Regression AISTATS 2025 Beyond Worst-Case Dimensionality Reduction for Sparse Vectors ICLR 2025 Beyond Worst-Case Online Classification: VC-Based Regret Bounds for Relaxed Benchmarks COLT 2025 Bias-variance decompositions: the exclusive privilege of Bregman divergences JMLR 2025 Bilevel Reinforcement Learning via the Development of Hyper-gradient without Lower-Level Convexity AISTATS 2025 Bimodal Depth-First Search for Scalable GAC for AllDifferent IJCAI 2025 Black-box Optimization with Unknown Constraints via Overparameterized Deep Neural Networks UAI 2025 Black-Box Reductions for Decentralized Online Convex Optimization in Changing Environments COLT 2025 Blackwell’s Approachability with Approximation Algorithms COLT 2025 Blind Image Deblurring with FFT-ReLU Sparsity Prior WACV 2025 BOIDS: High-Dimensional Bayesian Optimization via Incumbent-Guided Direction Lines and Subspace Embeddings AAAI 2025 Boosting Perturbed Gradient Ascent for Last-Iterate Convergence in Games ICLR 2025 BOPO: Neural Combinatorial Optimization via Best-anchored and Objective-guided Preference Optimization ICML 2025