AAAI 2023 accepted papers on Learning theory and algorithms
229 of the 2,023 papers accepted at AAAI 2023 (11.3%) are on Learning theory and algorithms, compared with 14.9% at AAAI 2022. They fall into 9 topics.
See AAAI 2023 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 · 76 papers
- Runtime Analysis for the NSGA-II: Provable Speed-Ups from Crossover (51 citations)
- A Proof That Using Crossover Can Guarantee Exponential Speed-Ups in Evolutionary Multi-Objective Optimisation (32 citations)
- TransPath: Learning Heuristics for Grid-Based Pathfinding via Transformers (22 citations)
- Improving Pareto Front Learning via Multi-Sample Hypernetworks (17 citations)
- NuWLS: Improving Local Search for (Weighted) Partial MaxSAT by New Weighting Techniques (16 citations)
- Learning Interpretable Temporal Properties from Positive Examples Only (14 citations)
- FASTDIAGP: An Algorithm for Parallelized Direct Diagnosis (13 citations)
- Predict+Optimize for Packing and Covering LPs with Unknown Parameters in Constraints (13 citations)
- Complexity of Safety and coSafety Fragments of Linear Temporal Logic (12 citations)
- Expressive Optimal Temporal Planning via Optimization Modulo Theory (9 citations)
- Neural TSP Solver with Progressive Distillation (9 citations)
- Circuit Minimization with QBF-Based Exact Synthesis (8 citations)
and 64 more in the interactive map.
Submodular and game algorithms · 47 papers
- Rethinking Data-Free Quantization as a Zero-Sum Game (19 citations)
- Proportionality in Approval-Based Participatory Budgeting (13 citations)
- Participatory Budgeting Designs for the Real World (12 citations)
- Reachability Games Modulo Theories with a Bounded Safety Player (12 citations)
- Ballot Length in Instant Runoff Voting (10 citations)
- Class Fairness in Online Matching (9 citations)
- Representation with Incomplete Votes (9 citations)
- When Congestion Games Meet Mobile Crowdsourcing: Selective Information Disclosure (9 citations)
- Proportional Decisions in Perpetual Voting (8 citations)
- Rank Aggregation Using Scoring Rules (8 citations)
- Utility Maximizer or Value Maximizer: Mechanism Design for Mixed Bidders in Online Advertising (8 citations)
- Diversity Maximization in the Presence of Outliers (6 citations)
and 35 more in the interactive map.
Prediction and decision losses · 43 papers
- Uniform Sequence Better: Time Interval Aware Data Augmentation for Sequential Recommendation (92 citations)
- Multiple Robust Learning for Recommendation (24 citations)
- Predictive Multiplicity in Probabilistic Classification (23 citations)
- Online Random Feature Forests for Learning in Varying Feature Spaces (14 citations)
- Optimal Decision Diagrams for Classification (12 citations)
- Interventional SHAP Values and Interaction Values for Piecewise Linear Regression Trees (11 citations)
- A Model-Agnostic Heuristics for Selective Classification (10 citations)
- Optimal Sparse Regression Trees (9 citations)
- Variable-Based Calibration for Machine Learning Classifiers (9 citations)
- Solving Explainability Queries with Quantification: The Case of Feature Relevancy (8 citations)
- The Influence of Dimensions on the Complexity of Computing Decision Trees (8 citations)
- Fundamentals of Task-Agnostic Data Valuation (7 citations)
and 31 more in the interactive map.
Fairness · 24 papers
- Fair Representation Learning for Recommendation: A Mutual Information Perspective (31 citations)
- Fairness and Explainability: Bridging the Gap towards Fair Model Explanations (24 citations)
- Accurate Fairness: Improving Individual Fairness without Trading Accuracy (23 citations)
- Censored Fairness through Awareness (19 citations)
- CertiFair: A Framework for Certified Global Fairness of Neural Networks (15 citations)
- Rawlsian Fairness in Online Bipartite Matching: Two-Sided, Group, and Individual (12 citations)
- Moral Machine or Tyranny of the Majority? (11 citations)
- Minimax AUC Fairness: Efficient Algorithm with Provable Convergence (10 citations)
- Fairness in Contextual Resource Allocation Systems: Metrics and Incompatibility Results (9 citations)
- Counterfactual Fairness Is Basically Demographic Parity (8 citations)
- Social Bias Meets Data Bias: The Impacts of Labeling and Measurement Errors on Fairness Criteria (8 citations)
- Can We Trust Fair-AI? (7 citations)
and 12 more in the interactive map.
Sample complexity · 12 papers
- From Understanding the Population Dynamics of the NSGA-II to the First Proven Lower Bounds (50 citations)
- On Solution Functions of Optimization: Universal Approximation and Covering Number Bounds (9 citations)
- Efficient and Accurate Learning of Mixtures of Plackett-Luce Models (4 citations)
- Global Convergence of Two-Timescale Actor-Critic for Solving Linear Quadratic Regulator (4 citations)
- The Parameterized Complexity of Network Microaggregation (3 citations)
- A Parameterized Theory of PAC Learning (2 citations)
- Computing Divergences between Discrete Decomposable Models (2 citations)
- Tree Learning: Optimal Sample Complexity and Algorithms (2 citations)
- Automata Cascades: Expressivity and Sample Complexity (1 citation)
- Markov Decision Processes with Time-Varying Geometric Discounting (1 citation)
- A Structural Complexity Analysis of Synchronous Dynamical Systems
- On Error and Compression Rates for Prototype Rules
Clustering · 12 papers
- Auto-Weighted Multi-View Clustering for Large-Scale Data (98 citations)
- Scalable and Effective Conductance-Based Graph Clustering (23 citations)
- Centerless Multi-View K-means Based on the Adjacency Matrix (13 citations)
- Clustering What Matters: Optimal Approximation for Clustering with Outliers (11 citations)
- XClusters: Explainability-First Clustering (11 citations)
- UEQMS: UMAP Embedded Quick Mean Shift Algorithm for High Dimensional Clustering (5 citations)
- Understanding the Generalization Performance of Spectral Clustering Algorithms (5 citations)
- Incremental Density-Based Clustering with Grid Partitioning (Student Abstract) (2 citations)
- Parameterized Algorithms for Colored Clustering (2 citations)
- Scalable and Globally Optimal Generalized L₁ K-center Clustering via Constraint Generation in Mixed Integer Linear Programming (2 citations)
- Fuzzy C-means: Differences on Clustering Behavior between High Dimensional and Functional Data (Student Abstract) (1 citation)
- Principled and Efficient Motif Finding for Structure Learning of Lifted Graphical Models
Matrix and tensor methods · 8 papers
- Enhanced Tensor Low-Rank and Sparse Representation Recovery for Incomplete Multi-View Clustering (81 citations)
- Tensor Compressive Sensing Fused Low-Rankness and Local-Smoothness (22 citations)
- Efficient Top-K Feature Selection Using Coordinate Descent Method (15 citations)
- Generalization Bounds for Inductive Matrix Completion in Low-Noise Settings (4 citations)
- Semidefinite Programming versus Burer-Monteiro Factorization for Matrix Sensing (2 citations)
- Properties of Position Matrices and Their Elections (1 citation)
- Robust and Fast Measure of Information via Low-Rank Representation
- A Faster Practical Approximation Scheme for the Permanent
Kernels and regression theory · 6 papers
- Practical Markov Boundary Learning without Strong Assumptions (12 citations)
- Stable Learning via Sparse Variable Independence (12 citations)
- Provable Pathways: Learning Multiple Tasks over Multiple Paths (3 citations)
- An Operator Theoretic Approach for Analyzing Sequence Neural Networks (2 citations)
- On the Complexity of PAC Learning in Hilbert Spaces (1 citation)
- Theory of Mind: A Familiar Aspect of Humanity to Give Machines