conftrace_
← Topics

Mathematics & Optimization

16,944 papers (0 classified directly here)

Subtopics

Optimization (12,959) Mathematics (5,735) Probability (519) Statistics (265) Discrete Mathematics (15)

Papers per year

1
23
162
566
1706
801
'00
'05
'10
'15
'20
'25

Papers (including subtopics)

Principal Variety Analysis CORL 2017
Learning Stable Task Sequences from Demonstration with Linear Parameter Varying Systems and Hidden Markov Models CORL 2017
Skip-Gram − Zipf + Uniform = Vector Additivity ACL 2017
Detect Rumors in Microblog Posts Using Propagation Structure via Kernel Learning ACL 2017
Semantic Dependency Parsing via Book Embedding ACL 2017
Joint Optimization of User-desired Content in Multi-document Summaries by Learning from User Feedback ACL 2017
Linguistic analysis of differences in portrayal of movie characters ACL 2017
CANE: Context-Aware Network Embedding for Relation Modeling ACL 2017
Generic Axiomatization of Families of Noncrossing Graphs in Dependency Parsing ACL 2017
An Algebra for Feature Extraction ACL 2017
Riemannian Optimization for Skip-Gram Negative Sampling ACL 2017
Information-Theory Interpretation of the Skip-Gram Negative-Sampling Objective Function ACL 2017
Oracle Summaries of Compressive Summarization ACL 2017
A Study on Trust Region Update Rules in Newton Methods for Large-scale Linear Classification ACML 2017
A Quantum-Inspired Ensemble Method and Quantum-Inspired Forest Regressors ACML 2017
Data sparse nonparametric regression with $ε$-insensitive losses ACML 2017
Rate Optimal Estimation for High Dimensional Spatial Covariance Matrices ACML 2017
Recovering Probability Distributions from Missing Data ACML 2017
Conditions beyond treewidth for tightness of higher-order LP relaxations AISTATS 2017
Large-Scale Data-Dependent Kernel Approximation AISTATS 2017
ASAGA: Asynchronous Parallel SAGA AISTATS 2017
Lower Bounds on Active Learning for Graphical Model Selection AISTATS 2017
Non-square matrix sensing without spurious local minima via the Burer-Monteiro approach AISTATS 2017
Nearly Instance Optimal Sample Complexity Bounds for Top-k Arm Selection AISTATS 2017
Guaranteed Non-convex Optimization: Submodular Maximization over Continuous Domains AISTATS 2017