NIPS 2015 has ended

Create Your Own Event

NIPS 2015

09:50 EST

Randomized Block Krylov Methods for Stronger and Faster Approximate Singular Value Decomposition Room 210 A

10:10 EST

b-bit Marginal Regression Room 210 A LASSO with Non-linear Measurements is Equivalent to One With Linear Measurements Room 210 A Minimum Weight Perfect Matching via Blossom Belief Propagation Room 210 A Optimal Rates for Random Fourier Features Room 210 A Submodular Hamming Metrics Room 210 A Super-Resolution Off the Grid Room 210 A Top-k Multiclass SVM Room 210 A

10:55 EST

Sampling from Probabilistic Submodular Models Room 210 A Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems Room 210 A

11:35 EST

Asynchronous Parallel Stochastic Gradient for Nonconvex Optimization Room 210 A Distributed Submodular Cover: Succinctly Summarizing Massive Data Room 210 A Distributionally Robust Logistic Regression Room 210 A Extending Gossip Algorithms to Distributed Estimation of U-statistics Room 210 A Frank-Wolfe Bayesian Quadrature: Probabilistic Integration with Theoretical Guarantees Room 210 A Newton-Stein Method: A Second Order Method for GLMs via Stein's Lemma Room 210 A On some provably correct cases of variational inference for topic models Room 210 A The Self-Normalized Estimator for Counterfactual Learning Room 210 A

14:50 EST

COEVOLVE: A Joint Point Process Model for Information Diffusion and Network Co-evolution Room 210 A Probabilistic Line Searches for Stochastic Optimization Room 210 A

15:30 EST

Automatic Variational Inference in Stan Room 210 A Data Generation as Sequential Decision Making Room 210 A Deep learning with Elastic Averaging SGD Room 210 A Latent Bayesian melding for integrating individual and population models Room 210 A Linear Response Methods for Accurate Covariance Estimates from Mean Field Variational Bayes Room 210 A Rapidly Mixing Gibbs Sampling for a Class of Factor Graphs Using Hierarchy Width Room 210 A Stochastic Expectation Propagation Room 210 A

16:30 EST

Competitive Distribution Estimation: Why is Good-Turing Good Room 210 A Fast Convergence of Regularized Learning in Games Room 210 A Interactive Control of Diverse Complex Characters with Neural Networks Room 210 A

17:30 EST

Biologically Inspired Dynamic Textures for Probing Motion Perception Room 210 A Closed-form Estimators for High-dimensional Generalized Linear Models Room 210 A High-dimensional neural spike train analysis with generalized count linear dynamical systems Room 210 A Large-Scale Bayesian Multi-Label Learning via Topic-Based Label Embeddings Room 210 A Learning Stationary Time Series using Gaussian Processes with Nonparametric Kernels Room 210 A Measuring Sample Quality with Stein's Method Room 210 A On the Pseudo-Dimension of Nearly Optimal Auctions Room 210 A The Human Kernel Room 210 A

09:50 EST

Learning Theory and Algorithms for Forecasting Non-stationary Time Series Room 210 A

10:10 EST

Accelerated Mirror Descent in Continuous and Discrete Time Room 210 A Adaptive Online Learning Room 210 A Bandit Smooth Convex Optimization: Improving the Bias-Variance Tradeoff Room 210 A Empirical Localization of Homogeneous Divergences on Discrete Sample Spaces Room 210 A Information-theoretic lower bounds for convex optimization with erroneous oracles Room 210 A Market Scoring Rules Act As Opinion Pools For Risk-Averse Agents Room 210 A Multi-Layer Feature Reduction for Tree Structured Group Lasso via Hierarchical Projection Room 210 A Optimal Testing for Properties of Distributions Room 210 A

10:55 EST

Deep Visual Analogy-Making Room 210 A End-To-End Memory Networks Room 210 A

11:35 EST

Attention-Based Models for Speech Recognition Room 210 A Deep Convolutional Inverse Graphics Network Room 210 A Learning to Segment Object Candidates Room 210 A Semi-supervised Convolutional Neural Networks for Text Categorization via Region Embedding Room 210 A Spatial Transformer Networks Room 210 A The Return of the Gating Network: Combining Generative Models and Discriminative Training in Natural Image Priors Room 210 A Training Very Deep Networks Room 210 A Where are they looking? Room 210 A

14:50 EST

A Reduced-Dimension fMRI Shared Response Model Room 210 A Attractor Network Dynamics Enable Preplay and Rapid Path Planning in Maze–like Environments Room 210 A

15:30 EST

A Tractable Approximation to Optimal Point Process Filtering: Application to Neural Encoding Room 210 A Action-Conditional Video Prediction using Deep Networks in Atari Games Room 210 A Backpropagation for Energy-Efficient Neuromorphic Computing Room 210 A Color Constancy by Learning to Predict Chromaticity from Luminance Room 210 A Decoupled Deep Neural Network for Semi-supervised Semantic Segmentation Room 210 A Inferring Algorithmic Patterns with Stack-Augmented Recurrent Nets Room 210 A Learning Wake-Sleep Recurrent Attention Models Room 210 A On-the-Job Learning with Bayesian Decision Theory Room 210 A

17:20 EST

Efficient Exact Gradient Update for training Deep Networks with Very Large Sparse Targets Room 210 A

17:40 EST

Equilibrated adaptive learning rates for non-convex optimization Room 210 A NEXT: A System for Real-World Development, Evaluation, and Application of Active Learning Room 210 A Pointer Networks Room 210 A Precision-Recall-Gain Curves: PR Analysis Done Right Room 210 A Structured Transforms for Small-Footprint Deep Learning Room 210 A

09:50 EST

Less is More: Nyström Computational Regularization Room 210 A

10:10 EST

Collaborative Filtering with Graph Information: Consistency and Scalable Methods Room 210 A Efficient and Parsimonious Agnostic Active Learning Room 210 A Fast and Guaranteed Tensor Decomposition via Sketching Room 210 A Learning with Symmetric Label Noise: The Importance of Being Unhinged Room 210 A Logarithmic Time Online Multiclass prediction Room 210 A Matrix Completion with Noisy Side Information Room 210 A Scalable Semi-Supervised Aggregation of Classifiers Room 210 A Spherical Random Features for Polynomial Kernels Room 210 A