Mathematics & Optimization
19,283 papers (0 classified directly here)
Subtopics · a paper can sit in several, so these overlap
Papers per year
1
2
8
13
8
24
100
100
125
139
182
227
311
530
574
599
676
880
1,053
1,491
1,739
1,880
1,904
2,070
2,345
1,785
517
2000
'5
'10
'15
'20
'25
Papers (including subtopics)
Dynamic Oracles for Top-Down and In-Order Shift-Reduce Constituent Parsing
EMNLP 2018
Dynamic Query Re-Planning using QOOP
OSDI 2018
Dynamic Resource Routing using Real-Time Dynamic Programming
IJCAI 2018
Early Stopping for Nonparametric Testing
NeurIPS 2018
Efficient Adaptive Online Learning via Frequent Directions
IJCAI 2018
Efficient Algorithms for Non-convex Isotonic Regression through Submodular Optimization
NeurIPS 2018
Efficient and Correct Test Scheduling for Ensembles of Network Policies
NSDI 2018
Efficient Attributed Network Embedding via Recursive Randomized Hashing
IJCAI 2018
Efficient Bandit Combinatorial Optimization Algorithm with Zero-suppressed Binary Decision Diagrams
AISTATS 2018
Efficient Computation of Approximate Equilibria in Discrete Colonel Blotto Games
IJCAI 2018
Efficient Computation of Implicational Universals in Constraint-Based Phonology Through the Hyperplane Separation Theorem
EMNLP 2018
Efficient Convex Completion of Coupled Tensors using Coupled Nuclear Norms
NeurIPS 2018
Efficient Convex Optimization with Membership Oracles
COLT 2018
Efficient coordinate-wise leading eigenvector computation
ALT 2018
Efficient First-Order Algorithms for Adaptive Signal Denoising
ICML 2018
Efficient High Dimensional Bayesian Optimization with Additivity and Quadrature Fourier Features
NeurIPS 2018
Efficient Language Model Adaptation with Noise Contrastive Estimation and Kullback-Leibler Regularization
Interspeech 2018
Efficient Learning with a Family of Nonconvex Regularizers by Redistributing Nonconvexity
JMLR 2018
Efficient Localized Inference for Large Graphical Models
IJCAI 2018
Efficient Mechanisms for Peer Grading and Dueling Bandits
ACML 2018
Efficient online algorithms for fast-rate regret bounds under sparsity
NeurIPS 2018
Efficient Online Portfolio with Logarithmic Regret
NeurIPS 2018
Efficient Projection onto the Perfect Phylogeny Model
NeurIPS 2018
Efficient, Sparse Representation of Manifold Distance Matrices for Classical Scaling
CVPR 2018
Efficient Symbolic Integration for Probabilistic Inference
IJCAI 2018