AAAI 2020 accepted papers on Learning theory and algorithms
226 of the 1,610 papers accepted at AAAI 2020 (14.0%) are on Learning theory and algorithms, compared with 19.3% at AAAI 2019. They fall into 9 topics.
See AAAI 2020 in the interactive map
Working on something in this area? Describe your idea in scime atlas to see the closest papers by meaning and how crowded the spot has become.
Topics and papers
Combinatorial and search optimization · 77 papers
- Smart Predict-and-Optimize for Hard Combinatorial Optimization Problems (132 citations)
- MIPaaL: Mixed Integer Program as a Layer (118 citations)
- HDDL: An Extension to PDDL for Expressing Hierarchical Planning Problems (104 citations)
- Neural Approximate Dynamic Programming for On-Demand Ride-Pooling (85 citations)
- FastLAS: Scalable Inductive Logic Programming Incorporating Domain-Specific Optimisation Criteria (58 citations)
- Modular Robot Design Synthesis with Deep Reinforcement Learning (42 citations)
- A New Approach to Plan-Space Explanation: Analyzing Plan-Property Dependencies in Oversubscription Planning (40 citations)
- Reshaping Diverse Planning (35 citations)
- Monte Carlo Tree Search in Continuous Spaces Using Voronoi Optimistic Optimization with Regret Bounds (33 citations)
- A Learning Based Branch and Bound for Maximum Common Subgraph Related Problems (32 citations)
- Symbolic Top-k Planning (32 citations)
- Dynamic Programming for Predict+Optimise (31 citations)
and 65 more in the interactive map.
Submodular and game algorithms · 60 papers
- An Efficient Evolutionary Algorithm for Subset Selection with General Cost Constraints (43 citations)
- Optimization of Chance-Constrained Submodular Functions (43 citations)
- Communication, Distortion, and Randomness in Metric Voting (36 citations)
- Subset Selection by Pareto Optimization with Recombination (36 citations)
- An Analysis Framework for Metric Voting based on LP Duality (32 citations)
- Computing Equilibria in Binary Networked Public Goods Games (27 citations)
- Price of Fairness in Budget Division and Probabilistic Social Choice (27 citations)
- Balancing Spreads of Influence in a Social Network (22 citations)
- End-to-End Game-Focused Learning of Adversary Behavior in Security Games (19 citations)
- To Signal or Not To Signal: Exploiting Uncertain Real-Time Information in Signaling Games for Security and Sustainability (18 citations)
- Parameterized Complexity of Envy-Free Resource Allocation in Social Networks (14 citations)
- Adaptive Greedy versus Non-Adaptive Greedy for Influence Maximization (13 citations)
and 48 more in the interactive map.
Prediction and decision losses · 25 papers
- Learning Optimal Decision Trees Using Caching Branch-and-Bound Search (129 citations)
- Stable Prediction with Model Misspecification and Agnostic Distribution Shift (129 citations)
- Efficient Inference of Optimal Decision Trees (60 citations)
- Regression under Human Assistance (44 citations)
- Training Decision Trees as Replacement for Convolution Layers (44 citations)
- Regional Tree Regularization for Interpretability in Deep Neural Networks (41 citations)
- Less Is Better: Unweighted Data Subsampling via Influence Function (40 citations)
- ADDMC: Weighted Model Counting with Algebraic Decision Diagrams (35 citations)
- Outlier Detection Ensemble with Embedded Feature Selection (31 citations)
- Distributionally Robust Counterfactual Risk Minimization (30 citations)
- An Information-Theoretic Quantification of Discrimination with Exempt Features (19 citations)
- Stochastic Loss Function (16 citations)
and 13 more in the interactive map.
Clustering · 20 papers
- Multi-View Clustering in Latent Embedding Space (300 citations)
- Tensor-SVD Based Graph Learning for Multi-View Subspace Clustering (240 citations)
- Unified Graph and Low-Rank Tensor Learning for Multi-View Clustering (122 citations)
- Multi-View Multiple Clusterings Using Deep Matrix Factorization (86 citations)
- Shared Generative Latent Representation Learning for Multi-View Clustering (76 citations)
- Multi-View Spectral Clustering with Optimal Neighborhood Laplacian Matrix (65 citations)
- A Cluster-Weighted Kernel K-Means Method for Multi-View Clustering (61 citations)
- Lifelong Spectral Clustering (25 citations)
- Robust Self-Weighted Multi-View Projection Clustering (25 citations)
- Visual Tactile Fusion Object Clustering (23 citations)
- Making Existing Clusterings Fairer: Algorithms, Complexity Results and Insights (22 citations)
- Deep Embedded Non-Redundant Clustering (21 citations)
and 8 more in the interactive map.
Matrix and tensor methods · 14 papers
- A Generalized Framework for Edge-Preserving and Structure-Preserving Image Smoothing (133 citations)
- Fast Adaptively Weighted Matrix Factorization for Recommendation with Implicit Feedback (67 citations)
- Tensor Completion for Weakly-Dependent Data on Graph for Metro Passenger Flow Prediction (56 citations)
- Polynomial Matrix Completion for Missing Data Imputation and Transductive Learning (38 citations)
- A Simple and Efficient Tensor Calculus (29 citations)
- Fast and Efficient Boolean Matrix Factorization by Geometric Segmentation (25 citations)
- Robust Tensor Decomposition via Orientation Invariant Tubal Nuclear Norms (25 citations)
- Safe Sample Screening for Robust Support Vector Machine (23 citations)
- Nonlinear System Identification via Tensor Completion (10 citations)
- Do Subsampled Newton Methods Work for High-Dimensional Data? (9 citations)
- On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank (7 citations)
- Beyond Unfolding: Exact Recovery of Latent Convex Tensor Decomposition Under Reshuffling (6 citations)
and 2 more in the interactive map.
Fairness · 12 papers
- Pairwise Fairness for Ranking and Regression (95 citations)
- Bursting the Filter Bubble: Fairness-Aware Network Link Prediction (86 citations)
- Perpetual Voting: Fairness in Long-Term Decision Making (50 citations)
- Balancing the Tradeoff between Profit and Fairness in Rideshare Platforms during High-Demand Hours (49 citations)
- Fairness for Robust Log Loss Classification (44 citations)
- Incremental Fairness in Two-Sided Market Platforms: On Smoothly Updating Recommendations (42 citations)
- Fairness-Aware Demand Prediction for New Mobility (39 citations)
- Learning Fair Naive Bayes Classifiers by Discovering and Eliminating Discrimination Patterns (22 citations)
- Faking Fairness via Stealthily Biased Sampling (19 citations)
- FairyTED: A Fair Rating Predictor for TED Talk Data (12 citations)
- Fairness in Network Representation by Latent Structural Heterogeneity in Observational Data (10 citations)
- Designing Committees for Mitigating Biases
Sample complexity · 9 papers
- Stable Learning via Sample Reweighting (131 citations)
- On Performance Estimation in Automatic Algorithm Configuration (21 citations)
- Chain Length and CSPs Learnable with Few Queries (13 citations)
- Sequential Mode Estimation with Oracle Queries (11 citations)
- Enhancing Nearest Neighbor Based Entropy Estimator for High Dimensional Distributions via Bootstrapping Local Ellipsoid (8 citations)
- Bounds and Complexity Results for Learning Coalition-Based Interaction Functions in Networked Social Systems
- Estimating Stochastic Linear Combination of Non-Linear Regressions
- Manipulating Districts to Win Elections: Fine-Grained Complexity
- On Swap Convexity of Voting Rules
Kernels and regression theory · 7 papers
- Rethinking Generalization of Neural Models: A Named Entity Recognition Case Study (74 citations)
- Random Fourier Features via Fast Surrogate Leverage Weighted Sampling (15 citations)
- Automated Spectral Kernel Learning (13 citations)
- Information-Theoretic Understanding of Population Risk Improvement with Model Compression (12 citations)
- Divide-and-Conquer Learning with Nyström: Optimal Rate and Algorithm (9 citations)
- Improved PAC-Bayesian Bounds for Linear Regression (8 citations)
- Meta-Learning PAC-Bayes Priors in Model Averaging (7 citations)
