AAAI 2017 accepted papers on Learning theory and algorithms
198 of the 639 papers accepted at AAAI 2017 (31.0%) are on Learning theory and algorithms, compared with 28.3% at AAAI 2016. They fall into 8 topics.
See AAAI 2017 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 · 55 papers
- Best-First Width Search: Exploration and Exploitation in Classical Planning (87 citations)
- Self-Paced Multi-Task Learning (82 citations)
- Solving High-Dimensional Multi-Objective Optimization Problems with Low Effective Dimensions (81 citations)
- Non-Deterministic Planning with Temporally Extended Goals: LTL over Finite and Infinite Traces (80 citations)
- Ontology-Based Data Access with a Horn Fragment of Metric Temporal Logic (68 citations)
- Data-Driven Approximations to NP-Hard Problems (56 citations)
- On the Disruptive Effectiveness of Automated Planning for LTLf-Based Trace Alignment (55 citations)
- Maximizing the Probability of Arriving on Time: A Practical Q-Learning Method (54 citations)
- An Analysis of Monte Carlo Tree Search (52 citations)
- Efficient Parameter Importance Analysis via Ablation with Surrogates (46 citations)
- Deep Learning Quadcopter Control via Risk-Aware Active Learning (39 citations)
- LPMLN, Weak Constraints, and P-log (38 citations)
and 43 more in the interactive map.
Submodular and game algorithms · 44 papers
- Proportional Justified Representation (117 citations)
- Algorithms for Max-Min Share Fair Allocation of Indivisible Chores (89 citations)
- Multiwinner Approval Rules as Apportionment Methods (83 citations)
- Mechanism Design in Social Networks (57 citations)
- Heuristic Search Value Iteration for One-Sided Partially Observable Stochastic Games (55 citations)
- Selecting Sequences of Items via Submodular Maximization (50 citations)
- Non-Monotone DR-Submodular Function Maximization (49 citations)
- Faster and Simpler Algorithm for Optimal Strategies of Blotto Game (41 citations)
- Social Choice Under Metric Preferences: Scoring Rules and STV (33 citations)
- StructInf: Mining Structural Influence from Social Streams (33 citations)
- Phragmén’s Voting Methods and Justified Representation (31 citations)
- Preferences Single-Peaked on a Circle (28 citations)
and 32 more in the interactive map.
Prediction and decision losses · 27 papers
- Preference Elicitation For Participatory Budgeting (77 citations)
- Multiclass Capped ℓp-Norm SVM for Robust Classifications (74 citations)
- Parameter Free Large Margin Nearest Neighbor for Distance Metric Learning (44 citations)
- Gated Neural Networks for Option Pricing: Rationality by Design (37 citations)
- Recognising Multidimensional Euclidean Preferences (37 citations)
- A General Framework for Sparsity Regularized Feature Selection via Iteratively Reweighted Least Square Minimization (36 citations)
- Proper Proxy Scoring Rules (36 citations)
- Portfolio Selection via Subset Resampling (35 citations)
- Multilinear Regression for Embedded Feature Selection with Application to fMRI Analysis (31 citations)
- Improving Efficiency of SVM k-Fold Cross-Validation by Alpha Seeding (28 citations)
- Pairwise HITS: Quality Estimation from Pairwise Comparisons in Creator-Evaluator Crowdsourcing Process (28 citations)
- Generalized Ambiguity Decompositions for Classification with Applications in Active Learning and Unsupervised Ensemble Pruning (25 citations)
and 15 more in the interactive map.
Matrix and tensor methods · 25 papers
- Low-Rank Tensor Completion with Total Variation for Visual Data Inpainting (154 citations)
- Low-Rank Linear Cold-Start Recommendation from Social Data (69 citations)
- Low-Rank Factorization of Determinantal Point Processes (67 citations)
- Learning Sparse Task Relations in Multi-Task Learning (64 citations)
- A Unified Convex Surrogate for the Schatten-p Norm (57 citations)
- Efficient Sparse Low-Rank Tensor Completion Using the Frank-Wolfe Algorithm (36 citations)
- Solving Indefinite Kernel Support Vector Machine with Difference of Convex Functions Programming (27 citations)
- Matrix Factorisation for Scalable Energy Breakdown (26 citations)
- Two-Dimensional PCA with F-Norm Minimization (26 citations)
- Beyond RPCA: Flattening Complex Noise in the Frequency Domain (25 citations)
- A Sparse Dictionary Learning Framework to Discover Discriminative Source Activations in EEG Brain Mapping (17 citations)
- MPGL: An Efficient Matching Pursuit Method for Generalized LASSO (14 citations)
and 13 more in the interactive map.
Clustering · 22 papers
- Multi-View Clustering via Deep Matrix Factorization (529 citations)
- Unsupervised Large Graph Embedding (160 citations)
- Optimal Neighborhood Kernel Clustering with Multiple Kernels (128 citations)
- Twin Learning for Similarity and Clustering: A Unified Kernel Approach (104 citations)
- Multiple Kernel k-Means with Incomplete Kernels (75 citations)
- Compressed K-Means for Large-Scale Clustering (74 citations)
- Image Cosegmentation via Saliency-Guided Constrained Clustering with Cosine Similarity (65 citations)
- Balanced Clustering with Least Square Regression (64 citations)
- Cascade Subspace Clustering (64 citations)
- Bilateral k-Means Algorithm for Fast Co-Clustering (40 citations)
- Local Centroids Structured Non-Negative Matrix Factorization (32 citations)
- Robust Manifold Matrix Factorization for Joint Clustering and Feature Extraction (25 citations)
and 10 more in the interactive map.
Sample complexity · 17 papers
- When and Why Are Deep Networks Better Than Shallow Ones? (194 citations)
- Vote Until Two of You Agree: Mechanisms with Small Distortion and Sample Complexity (47 citations)
- Scanpath Complexity: Modeling Reading Effort Using Gaze Information (24 citations)
- Approximation and Parameterized Complexity of Minimax Approval Voting (16 citations)
- Learning Residual Alternating Automata (15 citations)
- Near-Optimal Active Learning of Halfspaces via Query Synthesis in the Noisy Setting (15 citations)
- Phase Transitions for Scale-Free SAT Formulas (15 citations)
- Query Complexity of Tournament Solutions (13 citations)
- New Lower Bound for the Minimum Sum Coloring Problem (11 citations)
- Number Restrictions on Transitive Roles in Description Logics with Nominals (11 citations)
- The Opacity of Backbones (11 citations)
- Inductive Pairwise Ranking: Going Beyond the n log(n) Barrier (9 citations)
and 5 more in the interactive map.
Kernels and regression theory · 6 papers
- Infinite Kernel Learning: Generalization Bounds and Algorithms (24 citations)
- ERMMA: Expected Risk Minimization for Matrix Approximation-based Recommender Systems (13 citations)
- The Kernel Kalman Rule — Efficient Nonparametric Inference with Recursive Least Squares (11 citations)
- Random Features for Shift-Invariant Kernels with Moment Matching (5 citations)
- Generalization Analysis for Ranking Using Integral Operator (4 citations)
- Binary Embedding with Additive Homogeneous Kernels (1 citation)
