AAAI 2025 accepted papers on Learning theory and algorithms
232 of the 3,486 papers accepted at AAAI 2025 (6.7%) are on Learning theory and algorithms, compared with 10.2% at AAAI 2024. They fall into 9 topics.
See AAAI 2025 in the interactive map
Working on something in this area? Describe your idea in scime atlas to see the closest accepted papers by meaning and how crowded the spot has become.
Topics and papers
Combinatorial and search optimization · 87 papers
- DualOpt: A Dual Divide-and-Optimize Algorithm for the Large-scale Traveling Salesman Problem (7 citations)
- A Many-Objective Problem Where Crossover Is Provably Indispensable (5 citations)
- Speeding Up the NSGA-II with a Simple Tie-Breaking Rule (5 citations)
- User Preference Meets Pareto-Optimality in Multi-Objective Bayesian Optimization (5 citations)
- (1+1) Genetic Programming with Functionally Complete Instruction Sets Can Evolve Boolean Conjunctions and Disjunctions with Arbitrarily Small Error (4 citations)
- Runtime Analysis for Multi-Objective Evolutionary Algorithms in Unbounded Integer Spaces (4 citations)
- Dynamic Algorithm Termination for Branch-and-Bound-based Neural Network Verification (3 citations)
- Dynamic Back-Substitution in Bound-Propagation-Based Neural Network Verification (3 citations)
- Expected Hypervolume Improvement Is a Particular Hypervolume Improvement (3 citations)
- Fast Contiguous Somatic Hypermutations for Single-Objective Optimisation and Multi-Objective Optimisation Via Decomposition (3 citations)
- Proactive and Reactive Constraint Programming for Stochastic Project Scheduling with Maximal Time-Lags (3 citations)
- Search Strategy Generation for Branch and Bound Using Genetic Programming (3 citations)
and 75 more in the interactive map.
Submodular and game algorithms · 54 papers
- A Thorough Comparison Between Independent Cascade and Susceptible-Infected-Recovered Models (8 citations)
- Epistemic EFX Allocations Exist for Monotone Valuations (4 citations)
- Hyperparametric Robust and Dynamic Influence Maximization (4 citations)
- Learning to Manipulate Under Limited Information (4 citations)
- Computing Game Symmetries and Equilibria That Respect Them (3 citations)
- On the Power of Strategic Corpus Enrichment in Content Creation Games (3 citations)
- Decentralized and Uncoordinated Learning of Stable Matchings: A Game-Theoretic Approach (2 citations)
- Incentives for Early Arrival (2 citations)
- Proportional Representation in Practice: Quantifying Proportionality in Ordinal Elections (2 citations)
- Proportionally Fair Makespan Approximation (2 citations)
- The Value of Recall in Extensive-Form Games (2 citations)
- Verifying Proportionality in Temporal Voting (2 citations)
and 42 more in the interactive map.
Prediction and decision losses · 36 papers
- Learning About Algorithm Auditing in Five Steps: Scaffolding How High School Youth Can Systematically and Critically Evaluate Machine Learning Applications (10 citations)
- Conformal Thresholded Intervals for Efficient Regression (6 citations)
- BoolXAI: Explainable AI Using Expressive Boolean Formulas (4 citations)
- What Do Machine Learning Researchers Mean by “Reproducible”? (4 citations)
- Adaptive Merchant-Centric Risk Control via Unbiased Decision-Making and Dynamic Optimization in E-Commerce (3 citations)
- B2Opt: Learning to Optimize Black-box Optimization with Little Budget (3 citations)
- Axioms for AI Alignment from Human Feedback (2 citations)
- Even-if Explanations: Formal Foundations, Priorities and Complexity (2 citations)
- Free Lunch in the Forest: Functionally-Identical Pruning of Boosted Tree Ensembles (2 citations)
- Scalable Acceleration for Classification-Based Derivative-Free Optimization (2 citations)
- Transfer Learning Meets Functional Linear Regression: No Negative Transfer Under Posterior Drift (2 citations)
- Explainable Neural Networks with Guarantee: A Sparse Estimation Approach (1 citation)
and 24 more in the interactive map.
Clustering · 18 papers
- Collaborative Similarity Fusion and Consistency Recovery for Incomplete Multi-view Clustering (16 citations)
- Incomplete Multi-view Clustering via Diffusion Contrastive Generation (16 citations)
- Mixture of Experts as Representation Learner for Deep Multi-View Clustering (13 citations)
- Multi-view Granular-ball Contrastive Clustering (11 citations)
- k-HyperEdge Medoids for Clustering Ensemble (7 citations)
- TPCH: Tensor-interacted Projection and Cooperative Hashing for Multi-view Clustering (7 citations)
- Max-Mahalanobis Anchors Guidance for Multi-View Clustering (6 citations)
- Sharper Error Bounds in Late Fusion Multi-view Clustering with Eigenvalue Proportion Optimization (6 citations)
- Incremental Nyström-based Multiple Kernel Clustering (5 citations)
- KOALA: Kernel Coupling and Element Imputation Induced Multi-View Clustering (5 citations)
- Scalable One-Pass Incomplete Multi-View Clustering by Aligning Anchors (5 citations)
- Ambiguous Instance-Aware Contrastive Network with Multi-Level Matching for Multi-View Document Clustering (4 citations)
and 6 more in the interactive map.
Fairness · 12 papers
- Fairness-Accuracy Trade-Offs: A Causal Perspective (11 citations)
- FairTP: A Prolonged Fairness Framework for Traffic Prediction (3 citations)
- CUGF: A Reliable and Fair Recommendation Framework (2 citations)
- Active Fourier Auditor for Estimating Distributional Properties of ML Models (1 citation)
- Fairness Shields: Safeguarding against Biased Decision Makers (1 citation)
- Searching for Unfairness in Algorithms’ Outputs: Novel Tests and Insights (1 citation)
- FROC: Building Fair ROC from a Trained Classifier
- High School Course Scheduling: Student Preferences and Fairness Constraints (Student Abstract)
- Mitigating Bias in Machine Learning: A Comprehensive Review and Novel Approaches
- Proportionally Fair Matching via Randomized Rounding
- The Mainstays of Trustworthy Machine Learning
- Who’s the (Multi-)Fairest of Them All: Rethinking Interpolation-Based Data Augmentation Through the Lens of Multicalibration
Sample complexity · 10 papers
- Forecasting Competitions with Correlated Events (1 citation)
- On the Hardness of Training Deep Neural Networks Discretely (1 citation)
- A (1+?)-Approximation for Ultrametric Embedding in Subquadratic Time
- Consistent Query Answering over Existential Rules with Open and Closed Predicates
- Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size
- From Understanding Genetic Drift to a Smart-Restart Mechanism for Estimation-of-Distribution Algorithms (Journal Track)
- Learnability of Parameter-Bounded Bayes Nets
- Parameterized Complexity of Caching in Networks
- Sample Complexity of Linear Regression Models for Opinion Formation in Networks
- Two-Timescale Critic-Actor for Average Reward MDPs with Function Approximation
Matrix and tensor methods · 8 papers
- Neural Networks Perform Sufficient Dimension Reduction (3 citations)
- OTLRM: Orthogonal Learning-based Low-Rank Metric for Multi-Dimensional Inverse Problems (3 citations)
- Layered-Parameter Perturbation for Zeroth-Order Optimization of Optical Neural Networks (2 citations)
- Non-Convex Tensor Recovery from Local Measurements (2 citations)
- Tensor Decomposition Meets Knowledge Compilation: A Study Comparing Tensor Trains with OBDDs (1 citation)
- In-depth Analysis of Low-rank Matrix Factorisation in a Federated Setting
- Multi-Subspace Matrix Recovery from Permuted Data
- On the Trainability and Classical Simulability of Learning Matrix Product States Variationally
Kernels and regression theory · 6 papers
- Error Bounds for Gaussian Process Regression Under Bounded Support Noise with Applications to Safety Certification (5 citations)
- Bridging the Gap Between Hyperdimensional Computing and Kernel Methods via the Nyström Method (2 citations)
- Optimal Control Operator Perspective and a Neural Adaptive Spectral Method (2 citations)
- Generalization Analysis for Deep Contrastive Representation Learning (1 citation)
- When Can We Approximate Wide Contrastive Models with Neural Tangent Kernels and Principal Component Analysis? (1 citation)
- Optimized Random Features for the Neural Tangent Kernel (Student Abstract)