Skip to content
conftrace_

Papers (including subtopics)

Efficient Algorithms for Smooth Minimax Optimization NeurIPS 2019 Efficient Amortised Bayesian Inference for Hierarchical and Nonlinear Dynamical Systems ICML 2019 Efficient and Accurate Estimation of Lipschitz Constants for Deep Neural Networks NeurIPS 2019 Efficient and Scalable Multi-Task Regression on Massive Number of Tasks AAAI 2019 Efficient Approximation of Deep ReLU Networks for Functions on Low Dimensional Manifolds NeurIPS 2019 Efficient Bayesian Experimental Design for Implicit Models AISTATS 2019 Efficient Bayesian Optimization for Target Vector Estimation AISTATS 2019 Efficient Bayes Risk Estimation for Cost-Sensitive Classification AISTATS 2019 Efficient characterization of electrically evoked responses for neural interfaces NeurIPS 2019 Efficient Convex Relaxations for Streaming PCA NeurIPS 2019 Efficient Counterfactual Learning from Bandit Feedback AAAI 2019 Efficient Data Point Pruning for One-Class SVM AAAI 2019 Efficient Deep Approximation of GMMs NeurIPS 2019 Efficient Diversified Mini-Batch Selection using Variable High-layer Features ACML 2019 Efficient Forward Architecture Search NeurIPS 2019 Efficient Full-Matrix Adaptive Regularization ICML 2019 Efficient Gaussian Process Classification Using Pólya-Gamma Data Augmentation AAAI 2019 Efficient Greedy Coordinate Descent for Composite Problems AISTATS 2019 Efficient Identification of Approximate Best Configuration of Training in Large Datasets AAAI 2019 Efficient Image Retrieval via Decoupling Diffusion into Online and Offline Processing AAAI 2019 Efficient Inference in Multi-task Cox Process Models AISTATS 2019 Efficient Language Modeling with Automatic Relevance Determination in Recurrent Neural Networks ACL 2019 Efficient Learning of Restricted Boltzmann Machines Using Covariance Estimates ACML 2019 Efficient learning of smooth probability functions from Bernoulli tests with guarantees ICML 2019 Efficient Linear Bandits through Matrix Sketching AISTATS 2019