AAAI 2016 accepted papers on Learning theory and algorithms
155 of the 548 papers accepted at AAAI 2016 (28.3%) are on Learning theory and algorithms. They fall into 8 topics.
See AAAI 2016 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 · 48 papers
- Learning to Branch in Mixed Integer Programming (339 citations)
- Two Efficient Local Search Algorithms for Maximum Weight Clique Problem (100 citations)
- Derivative-Free Optimization via Classification (90 citations)
- Exponential Recency Weighted Average Branching Heuristic for SAT Solvers (76 citations)
- Complexity Results and Algorithms for Extension Enforcement in Abstract Argumentation (62 citations)
- The Complexity Landscape of Decompositional Parameters for ILP (58 citations)
- Bidirectional Search That Is Guaranteed to Meet in the Middle (56 citations)
- SDDs Are Exponentially More Succinct than OBDDs (55 citations)
- Numerical Relation Extraction with Minimal Supervision (51 citations)
- Multi-Objective Self-Paced Learning (34 citations)
- The Complexity of LTL on Finite Traces: Hard and Easy Fragments (32 citations)
- Identifying Search Keywords for Finding Relevant Social Media Posts (30 citations)
and 36 more in the interactive map.
Submodular and game algorithms · 46 papers
- "8 Amazing Secrets for Getting More Clicks": Detecting Clickbaits in News Streams Using Article Informality (200 citations)
- DRIMUX: Dynamic Rumor Influence Minimization with User Experience in Social Networks (184 citations)
- Submodular Optimization with Routing Constraints (150 citations)
- When Can the Maximin Share Guarantee Be Guaranteed? (93 citations)
- Blind, Greedy, and Random: Algorithms for Matching and Clustering Using Only Ordinal Information (53 citations)
- One Size Does Not Fit All: A Game-Theoretic Approach for Dynamically and Effectively Screening for Threats (52 citations)
- Unsupervised Feature Selection by Heuristic Search with Provable Bounds on Suboptimality (46 citations)
- Noisy Submodular Maximization via Adaptive Sampling with Applications to Crowdsourced Image Collection Summarization (45 citations)
- Using Correlated Strategies for Computing Stackelberg Equilibria in Extensive-Form Games (44 citations)
- Complexity of Hedonic Games with Dichotomous Preferences (41 citations)
- Graphical Hedonic Games of Bounded Treewidth (41 citations)
- Complexity of Shift Bribery in Committee Elections (38 citations)
and 34 more in the interactive map.
Prediction and decision losses · 17 papers
- A Comparative Study of Ranking-Based Semantics for Abstract Argumentation (132 citations)
- Deep Learning for Algorithm Portfolios (69 citations)
- Discriminative Analysis Dictionary Learning (69 citations)
- Towards Optimal Binary Code Learning via Ordinal Embedding (41 citations)
- Scientific Ranking over Heterogeneous Academic Hypernetwork (37 citations)
- Using the Shapley Value to Analyze Algorithm Portfolios (30 citations)
- Zero-Suppressed Sentential Decision Diagrams (22 citations)
- Indexable Probabilistic Matrix Factorization for Maximum Inner Product Search (17 citations)
- Sparse Perceptron Decision Tree for Millions of Dimensions (17 citations)
- Bagging Ensembles for the Diagnosis and Prognostication of Alzheimer's Disease (15 citations)
- Optimizing Resilience in Large Scale Networks (14 citations)
- Random Composite Forests (8 citations)
and 5 more in the interactive map.
Clustering · 17 papers
- The Constrained Laplacian Rank Algorithm for Graph-Based Clustering (904 citations)
- Multiple Kernel k-Means Clustering with Matrix-Induced Regularization (246 citations)
- Approximate K-Means++ in Sublinear Time (123 citations)
- Topic Concentration in Query Focused Summarization Datasets (33 citations)
- Scalable Sequential Spectral Clustering (25 citations)
- New l1-Norm Relaxations and Optimizations for Graph Clustering (24 citations)
- Product Grassmann Manifold Representation and Its LRR Models (20 citations)
- Generalised Brown Clustering and Roll-Up Feature Generation (16 citations)
- Decentralized Robust Subspace Clustering (13 citations)
- Maximum Margin Dirichlet Process Mixtures for Clustering (12 citations)
- The Hidden Convexity of Spectral Clustering (9 citations)
- Infinite Plaid Models for Infinite Bi-Clustering (7 citations)
and 5 more in the interactive map.
Matrix and tensor methods · 15 papers
- Top-N Recommender System via Matrix Completion (103 citations)
- Multi-Stage Multi-Task Learning with Reduced Rank (74 citations)
- Scalable Algorithms for Tractable Schatten Quasi-Norm Minimization (51 citations)
- Stochastic Optimization for Kernel PCA (22 citations)
- An Alternating Proximal Splitting Method with Global Convergence for Nonconvex Structured Sparsity Optimization (16 citations)
- Bayesian Matrix Completion via Adaptive Relaxed Spectral Regularization (11 citations)
- Optimal Discrete Matrix Completion (10 citations)
- Accelerated Sparse Linear Regression via Random Projection (9 citations)
- A Proximal Alternating Direction Method for Semi-Definite Rank Minimization (8 citations)
- Fixed-Rank Supervised Metric Learning on Riemannian Manifold (8 citations)
- Multitask Generalized Eigenvalue Program (6 citations)
- Scalable Completion of Nonnegative Matrix with Separable Structure (5 citations)
and 3 more in the interactive map.
Sample complexity · 6 papers
- On the Depth of Deep Neural Networks: A Theoretical View (164 citations)
- Closing the Gap Between Short and Long XORs for Model Counting (21 citations)
- Alternative Filtering for the Weighted Circuit Constraint: Comparing Lower Bounds for the TSP and Solving TSPTW (16 citations)
- Noise-Adaptive Margin-Based Active Learning and Lower Bounds under Tsybakov Noise Condition (14 citations)
- On the Complexity of mCP-nets (13 citations)
- Conservativeness of Untied Auto-Encoders (5 citations)
Kernels and regression theory · 5 papers
- Extending the Modelling Capacity of Gaussian Conditional Random Fields while Learning Faster (16 citations)
- Linear-Time Learning on Distributions with Approximate Kernel Embeddings (11 citations)
- Discriminative Vanishing Component Analysis (9 citations)
- Fast and Accurate Refined Nyström-Based Kernel SVM (9 citations)
- Common and Discriminative Subspace Kernel-Based Multiblock Tensor Partial Least Squares Regression (5 citations)
