NeurIPS 2018

1,011 papers

Top Research Directions

Research directions most represented by NeurIPS 2018 papers.

Scaling Gaussian Processes Beyond Cubic Complexity 18
Mitigating Gradient Variance in Stochastic Optimization 11
Sample Efficient Reinforcement Learning 11
Matrix-Free Curvature Estimation for Deep Learning 9
Escaping Saddle Points in Nonconvex Optimization 9
Navigating Non-Convex Loss Landscapes in Deep Learning 9
Overcoming the Cubic Complexity of Kernel Methods 9
Stochastic Noise Injection for Escaping Saddle Points 8
Inducing Point Approximations for Scalable Gaussian Processes 8
Variance Reduction in Stochastic Optimization 8
Communication Efficient Distributed Training of Large Models 8
Beyond the Deterministic Transition Assumption in Reinforcement Learning 7
Variance Reduction for Discrete Gradient Estimation 7
Overcoming Local Receptive Field Constraints in Visual Models 7
Basins of Attraction in Nonconvex Optimization 7

Top Authors

AuthorPapers
Joshua B. Tenenbaum10
Eric P. Xing8
Michael Jordan8
Sergey Levine8
Francis Bach7
Honglak Lee6
Masashi Sugiyama6
Mingyuan Zhou6
Stefano Ermon6
Tong Zhang6
Alessandro Rudi5
Jason D. Lee5
Jiajun Wu5
Jonathan W. Pillow5
Lorenzo Rosasco5
Pradeep Kumar Ravikumar5
Tie-Yan Liu5
Tuomas Sandholm5
William T. Freeman5
Xiaodan Liang5

Impactful Papers

Papers from NeurIPS 2018 that shaped research clusters.

Foundational

Influential

Papers

Title
Causal Discovery from Discrete Data using Hidden Compact Representation
Causal Inference and Mechanism Clustering of A Mixture of Additive Noise Models
Causal Inference via Kernel Deviance Measures
Causal Inference with Noisy and Missing Covariates via Matrix Factorization
Chaining Mutual Information and Tightening Generalization Bounds.
Chain of Reasoning for Visual Question Answering
ChannelNets: Compact and Efficient Convolutional Neural Networks via Channel-Wise Convolutions
Clebsch-Gordan Nets: a Fully Fourier Space Spherical Convolutional Neural Network
Clustering Redemption-Beyond the Impossibility of Kleinberg's Axioms
Cluster Variational Approximations for Structure Learning of Continuous-Time Bayesian Networks from Incomplete Data
COLA: Decentralized Linear Learning
Collaborative Learning for Deep Neural Networks
Combinatorial Optimization with Graph Convolutional Networks and Guided Tree Search
Communication Compression for Decentralized Training
Communication Efficient Parallel Algorithms for Optimization on Manifolds
Community Exploration: From Offline Optimization to Online Learning
Compact Generalized Non-local Network
Compact Representation of Uncertainty in Clustering
Completing State Representations using Spectral Learning.
Complex Gated Recurrent Neural Networks
Computationally and statistically efficient learning of causal Bayes nets using path queries
Computing Higher Order Derivatives of Matrix and Tensor Expressions
Computing Kantorovich-Wasserstein Distances on d-dimensional histograms using (d+1)-partite graphs
Conditional Adversarial Domain Adaptation
Confounding-Robust Policy Improvement
Connecting Optimization and Regularization Paths
Connectionist Temporal Classification with Maximum Entropy Regularization
Constant Regret, Generalized Mixability, and Mirror Descent
Constrained Cross-Entropy Method for Safe Reinforcement Learning
Constrained Generation of Semantically Valid Graphs via Regularizing Variational Autoencoders
Constrained Graph Variational Autoencoders for Molecule Design
Constructing Deep Neural Networks by Bayesian Network Structure Learning
Constructing Fast Network through Deconstruction of Convolution
Constructing Unrestricted Adversarial Examples with Generative Models
Contamination Attacks and Mitigation in Multi-Party Machine Learning
Content preserving text generation with attribute controls
Context-aware Synthesis and Placement of Object Instances
Context-dependent upper-confidence bounds for directed exploration
Contextual bandits with surrogate losses: Margin bounds and efficient algorithms
Contextual Combinatorial Multi-armed Bandits with Volatile Arms and Submodular Reward
Contextual Pricing for Lipschitz Buyers
Contextual Stochastic Block Models
Continuous-time Value Function Approximation in Reproducing Kernel Hilbert Spaces
Contour location via entropy reduction leveraging multiple information sources
Contrastive Learning from Pairwise Measurements
Convergence of Cubic Regularization for Nonconvex Optimization under KL Property
Convex Elicitation of Continuous Properties
Cooperative Holistic Scene Understanding: Unifying 3D Object, Layout, and Camera Pose Estimation
Cooperative Learning of Audio and Video Models from Self-Supervised Synchronization
Cooperative neural networks (CoNN): Exploiting prior independence structure for improved classification

« prev Page 4/21 next »