AAAI 2019 accepted papers on Learning theory and algorithms
221 of the 1,147 papers accepted at AAAI 2019 (19.3%) are on Learning theory and algorithms, compared with 19.7% at AAAI 2018. They fall into 9 topics.
See AAAI 2019 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 · 70 papers
- Learning Optimal Classification Trees Using a Binary Linear Program Formulation (165 citations)
- BIRD: Engineering an Efficient CNF-XOR SAT Solver and Its Applications to Approximate Model Counting (111 citations)
- Evolutionary Manytasking Optimization Based on Symbiosis in Biocoenosis (80 citations)
- On the Time Complexity of Algorithm Selection Hyper-Heuristics for Multimodal Optimisation (52 citations)
- Improving Optimization Bounds Using Machine Learning: Decision Diagrams Meet Deep Reinforcement Learning (49 citations)
- Reasoning over Streaming Data in Metric Temporal Datalog (43 citations)
- Learning Features and Abstract Actions for Computing Generalized Plans (42 citations)
- A Two-Individual Based Evolutionary Algorithm for the Flexible Job Shop Scheduling Problem (38 citations)
- Efficient Concept Induction for Description Logics (38 citations)
- Learning Logistic Circuits (38 citations)
- An Innovative Genetic Algorithm for the Quantum Circuit Compilation Problem (36 citations)
- Bringing Order to Chaos – A Compact Representation of Partial Order in SAT-Based HTN Planning (35 citations)
and 58 more in the interactive map.
Submodular and game algorithms · 52 papers
- Pareto Optimization for Subset Selection with Dynamic Cost Constraints (92 citations)
- Greedy Maximization of Functions with Bounded Curvature under Partition Matroid Constraints (39 citations)
- Regular Boardgames (26 citations)
- Coverage Centrality Maximization in Undirected Networks (23 citations)
- Migration as Submodular Optimization (23 citations)
- Optimal Interdiction of Urban Criminals with the Aid of Real-Time Information (20 citations)
- Blameworthiness in Strategic Games (18 citations)
- Active Preference Learning Based on Generalized Gini Functions: Application to the Multiagent Knapsack Problem (16 citations)
- A Memetic Approach for Sequential Security Games on a Plane with Moving Targets (13 citations)
- Randomized Strategies for Robust Combinatorial Optimization (9 citations)
- Submodular Optimization over Streams with Inhomogeneous Decays (9 citations)
- Subspace Selection via DR-Submodular Maximization on Lattices (7 citations)
and 40 more in the interactive map.
Prediction and decision losses · 30 papers
- Melding the Data-Decisions Pipeline: Decision-Focused Learning for Combinatorial Optimization (287 citations)
- Abduction-Based Explanations for Machine Learning Models (243 citations)
- Subtask Gated Networks for Non-Intrusive Load Monitoring (154 citations)
- Compiling Bayesian Network Classifiers into Decision Graphs (64 citations)
- Towards Optimal Discrete Online Hashing with Balanced Similarity (63 citations)
- The Goldilocks Zone: Towards Better Understanding of Neural Network Loss Landscapes (33 citations)
- Weighted Oblique Decision Trees (32 citations)
- Collaborative, Dynamic and Diversified User Profiling (27 citations)
- Improving One-Class Collaborative Filtering via Ranking-Based Implicit Regularizer (23 citations)
- Scalable Robust Kidney Exchange (20 citations)
- Constraint-Based Sequential Pattern Mining with Decision Diagrams (17 citations)
- Deep Neural Networks Constrained by Decision Rules (17 citations)
and 18 more in the interactive map.
Clustering · 16 papers
- Unified Embedding Alignment with Missing Views Inferring for Incomplete Multi-View Clustering (285 citations)
- One-Pass Incomplete Multi-View Clustering (169 citations)
- Anchors Bring Ease: An Embarrassingly Simple Approach to Partial Multi-View Clustering (138 citations)
- Efficient and Effective Incomplete Multi-View Clustering (94 citations)
- Spectral Clustering in Heterogeneous Information Networks (50 citations)
- Nearest-Neighbour-Induced Isolation Similarity and Its Impact on Density-Based Clustering (48 citations)
- The SpectACl of Nonconvex Clustering: A Spectral Approach to Density-Based Clustering (33 citations)
- Multi-View Information-Theoretic Co-Clustering for Co-Occurrence Data (31 citations)
- Hypergraph Optimization for Multi-Structural Geometric Model Fitting (28 citations)
- Tensor Decomposition for Multilayer Networks Clustering (24 citations)
- Multiple Independent Subspace Clusterings (20 citations)
- X-DMM: Fast and Scalable Model Based Text Clustering (8 citations)
and 4 more in the interactive map.
Matrix and tensor methods · 15 papers
- Tensor Ring Decomposition with Rank Minimization on Latent Space: An Efficient Approach for Tensor Completion (203 citations)
- A Recursive Algorithm for Projected Model Counting (28 citations)
- A Nonconvex Projection Method for Robust PCA (18 citations)
- Holographic Factorization Machines for Recommendation (17 citations)
- Complex Moment-Based Supervised Eigenmap for Dimensionality Reduction (14 citations)
- Near-Neighbor Methods in Random Preference Completion (11 citations)
- Sublinear Time Numerical Linear Algebra for Structured Matrices (8 citations)
- ReAl-LiFE: Accelerating the Discovery of Individualized Brain Connectomes on GPUs (7 citations)
- Cost-Sensitive Learning to Rank (6 citations)
- EA-CG: An Approximate Second-Order Method for Training Fully-Connected Neural Networks (6 citations)
- Robustness Can Be Cheap: A Highly Efficient Approach to Discover Outliers under High Outlier Ratios (6 citations)
- Data-Adaptive Metric Learning with Scale Alignment (5 citations)
and 3 more in the interactive map.
Kernels and regression theory · 15 papers
- Fast Incremental SVDD Learning Algorithm with the Gaussian Kernel (85 citations)
- Certifying the True Error: Machine Learning in Coq with Verified Generalization Guarantees (34 citations)
- Non-Asymptotic Uniform Rates of Consistency for k-NN Regression (28 citations)
- Capacity Control of ReLU Neural Networks by Basis-Path Norm (17 citations)
- Learning Adaptive Random Features (13 citations)
- A Sharper Generalization Bound for Divide-and-Conquer Ridge Regression (10 citations)
- Linear Kernel Tests via Empirical Likelihood for High-Dimensional Data (10 citations)
- Sparse Reject Option Classifier Using Successive Linear Programming (9 citations)
- Approximate Kernel Selection with Strong Approximate Consistency (6 citations)
- Dimension-Free Error Bounds from Random Projections (5 citations)
- Random Feature Maps for the Itemset Kernel (4 citations)
- MFPCA: Multiscale Functional Principal Component Analysis (3 citations)
and 3 more in the interactive map.
Fairness · 10 papers
- Path-Specific Counterfactual Fairness (286 citations)
- Learning Optimal and Fair Decision Trees for Non-Discriminative Decision-Making (156 citations)
- One-Network Adversarial Fairness (94 citations)
- Allocating Interventions Based on Predicted Outcomes: A Case Study on Homelessness Services (63 citations)
- Evolution of Collective Fairness in Hybrid Populations of Humans and Agents (39 citations)
- Convex Formulations for Fair Principal Component Analysis (38 citations)
- Bayesian Fairness (24 citations)
- Eliminating Latent Discrimination: Train Then Mask (10 citations)
- Comparative Document Summarisation via Classification (7 citations)
- Deep Bayesian Trust: A Dominant and Fair Incentive Mechanism for Crowd
Sample complexity · 9 papers
- The Kelly Growth Optimal Portfolio with Ensemble Learning (25 citations)
- Bias-Variance Trade-Off in Hierarchical Probabilistic Models Using Higher-Order Feature Interactions (6 citations)
- Interpretable Predictive Modeling for Climate Variables with Weighted Lasso (6 citations)
- Efficient Data Point Pruning for One-Class SVM (3 citations)
- Which Factorization Machine Modeling Is Better: A Theoretical Answer with Optimal Guarantee (3 citations)
- Efficient Optimal Approximation of Discrete Random Variables for Estimation of Probabilities of Missing Deadlines (2 citations)
- Learning Set Functions with Limited Complementarity (1 citation)
- Approximate Inference of Outcomes in Probabilistic Elections
- Random Dictators with a Random Referee: Constant Sample Complexity Mechanisms for Social Choice
