facebook twitter

Subject to change. Complete list of papers with supplementary material is on JMLR proceedings.

Posters sessions will be in parallel from the main conference:

  • Monday afternoon 3pm – 7pm
  • Tuesday morning 10am – 1pm
  • Tuesday afternoon 3pm – 7pm
  • Wednesday morning 10am – 1pm
And are denoted on the tables with a

With papers allocated as described in this schedule.

Birds of a Feather Unworkshop

This s a room where you can write a note with a subject, time, and place to meet other people for a discussion of your choosing. These meetings have no format and are not pre-planned, so have fun.

  • Room: Marriott: Duffy/Columbia 7th floor
  • Time: Thursday 8:30-5 Friday 8:30-4

Note: You can also find all the informations in the Booklet of the conference.

Main Conference

Monday Ballroom 1+2+Juliard Ballroom 3+4 Marquis Lyceum Empire Soho Liberty
08:30 – 08:40 Welcome
08:40 – 09:40 Invited Talk: Susan Athey, Causal Inference for Policy Evaluation
09:40 – 10:20 Break
10:20 – 11:10
11:11 – 11:30 Break
11:30 – 12:20
Lunch – on your own
02:00 – 02:50
02:51 – 03:10 Break
03:10 – 04:00
04:01 – 04:15 Break
04:15 – 05:05
05:06 – 05:25 Break
05:25 – 06:15
06:16 – 07:00 End of poster session started at 3pm
Tuesday Ballroom 1+2+Juliard Ballroom 3+4 Marquis Lyceum Empire Soho Liberty
08:30 – 09:30 Invited Talk: Fei-Fei Li, A Quest for Visual Intelligence in Computers
09:30 – 09:50 Test of Time Award Presentation: “Dynamic topic models”, David Blei and John Lafferty
09:50 – 10:30 Break
10:30 – 11:20
11:21 – 11:40 Break
11:40 – 12:30
Lunch – on your own – Poster session ending at 1pm
02:00 – 03:00 Invited Talk: Daniel Spielman, Laplacian Matrices of Graphs: Algorithms and Applications.
03:00 – 03:40 Break
03:40 – 04:48
04:48 – 05:10 Break
05:10 – 06:15
06:18 – 07:00 End of poster session started at 3pm
Wednesday Ballroom 1+2+Juliard Ballroom 3+4 Marquis Lyceum Empire Soho Liberty
08:30 – 09:55
09:55 – 10:20 Break
10:20 – 11:10
11:11 – 11:30 Break
11:30 – 12:20
Lunch – on your own – Poster session ending at 1pm
02:00 – 03:00 Invited Talk: Christos Faloutsos, Mining Large Graphs: Patterns, Anomalies, and Fraud Detection
03:00 – 03:40 Break
03:40 – 05:20
05:30 – 6:30 IMLS Business Meeting (Soho)
07:00 – 10:00 Intrepid Party

Detailed Schedule

Monday – Neural Networks and Deep Learning

Session chair: Hugo Larochelle

Location: Ballroom 1+2+Juliard
  • 10:20 – One-Shot Generalization in Deep Generative Models Danilo Rezende Google DeepMind, Shakir , Ivo Danihelka Google DeepMind, Karol Gregor DeepMind, Daan Wierstra Google DeepMindPaper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    Humans have an impressive ability to reason about new concepts and experiences from just a single example. In particular, humans have an ability for one-shot generalization: an ability to encounter a new concept, understand its structure, and then be able to generate compelling alternative variations of the concept.
    We develop machine learning systems with this important capacity by developing new deep generative models, models that combine the representational power of deep learning with the inferential power of Bayesian reasoning. We develop a class of sequential generative models that are built on the principles of feedback and attention. These two characteristics lead to generative models that are among the state-of-the art in density estimation and image generation. We demonstrate the one-shot generalization ability of our models using three tasks: unconditional sampling, generating new exemplars of a given concept, and generating new exemplars of a family of concepts. In all cases our models are able to generate compelling and diverse samples—having seen new examples just once—providing an important class of general-purpose models for one-shot machine learning.
  • 10:37 – Learning to Generate with Memory Chongxuan Li Tsinghua University, Jun Zhu Tsinghua, Bo Zhang Tsinghua UniversityPaper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    Memory units have been widely used to enrich the capabilities of deep networks on capturing long-term dependencies in reasoning and prediction tasks, but little investigation exists on deep generative models (DGMs) which are good at inferring high-level invariant representations from unlabeled data. This paper presents a deep generative model with a possibly large external memory and an attention mechanism to capture the local detail information that is often lost in the bottom-up abstraction process in representation learning. By adopting a smooth attention model, the whole network is trained end-to-end by optimizing a variational bound of data likelihood via auto-encoding variational Bayesian methods, where an asymmetric recognition network is learnt jointly to infer high-level invariant representations. The asymmetric architecture can reduce the competition between bottom-up invariant feature extraction and top-down generation of instance details. Our experiments on several datasets demonstrate that memory can significantly boost the performance of DGMs on various tasks, including density estimation, image generation, and missing value imputation, and DGMs with memory can achieve state-of-the-art quantitative results.
  • 10:54 – A Theory of Generative ConvNet Jianwen Xie UCLA, Yang Lu UCLA, Song-Chun Zhu UCLA, Yingnian Wu UCLAPaper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    We show that a generative random field model, which we call generative ConvNet, can be derived from the commonly used discriminative ConvNet, by assuming a ConvNet for multi-category classification and assuming one of the category is a base category generated by a reference distribution. If we further assume that the non-linearity in the ConvNet is Rectified Linear Unit (ReLU) and the reference distribution is Gaussian white noise, then we obtain a generative ConvNet model that is unique among energy-based models: The model is piecewise Gaussian, and the means of the Gaussian pieces are defined by an auto-encoder, where the filters in the bottom-up encoding become the basis functions in the top-down decoding, and the binary activation variables detected by the filters in the bottom-up convolution process become the coefficients of the basis functions in the top-down deconvolution process. The Langevin dynamics for sampling the generative ConvNet is driven by the reconstruction error of this auto-encoder. The contrastive divergence learning of the generative ConvNet reconstructs the training images by the auto-encoder. The maximum likelihood learning algorithm can synthesize realistic natural image patterns.
  • 11:30 – Deconstructing the Ladder Network Architecture Mohammad Pezeshki Universite de Montreal, Linxi Fan , Philemon Brakel , Aaron Courville , Yoshua Bengio U. of MontrealPaper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    The Ladder Network is a recent new approach to semi-supervised learning that turned out to be very successful. While showing impressive performance, the Ladder Network has many components intertwined, whose contributions are not obvious in such a complex architecture. This paper presents an extensive experimental investigation of variants of the Ladder Network in which we replaced or removed individual components to learn about their relative importance. For semi-supervised tasks, we conclude that the most important contribution is made by the lateral connections, followed by the application of noise, and the choice of what we refer to as the `combinator function’. As the number of labeled training examples increases, the lateral connections and the reconstruction criterion become less important, with most of the generalization improvement coming from the injection of noise in each layer. Finally, we introduce a combinator function that reduces test error rates on Permutation-Invariant MNIST to 0.57% for the supervised setting, and to 0.97% and 1.0% for semi-supervised settings with 1000 and 100 labeled examples, respectively.
  • 11:47 – Normalization Propagation: A Parametric Technique for Removing Internal Covariate Shift in Deep Networks Devansh Arpit SUNY Buffalo, Yingbo Zhou SUNY Buffalo, Bhargava Kota SUNY Buffalo, Venu Govindaraju SUNY BuffaloPaper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    While the authors of Batch Normalization (BN) identify and address an important problem involved in training deep networks– \textit{Internal Covariate Shift}– the current solution has certain drawbacks. For instance, BN depends on batch statistics for layerwise input normalization during training which makes the estimates of mean and standard deviation of input (distribution) to hidden layers inaccurate due to shifting parameter values (especially during initial training epochs). Another fundamental problem with BN is that it cannot be used with batch-size $ 1 $ during training. We address these drawbacks of BN by proposing a non-adaptive normalization technique for removing covariate shift, that we call \textit{Normalization Propagation}. Our approach does not depend on batch statistics, but rather uses a data-independent parametric estimate of mean and standard-deviation in every layer thus being computationally faster compared with BN. We exploit the observation that the pre-activation before Rectified Linear Units follow Gaussian distribution in deep networks, and that once the first and second order statistics of any given dataset are normalized, we can forward propagate this normalization without the need for recalculating the approximate statistics for hidden layers.
  • 12:04 – Unitary Evolution Recurrent Neural Networks Martin Arjovsky University of Buenos Aires, Amar Shah University of Cambridge, Yoshua Bengio Paper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    Recurrent neural networks (RNNs) are notoriously difficult to train. When the eigenvalues of the hidden to hidden weight matrix deviate from absolute value 1, optimization becomes difficult due to the well studied issue of vanishing and exploding gradients, especially when trying to learn long-term dependencies. To circumvent this problem, we propose a new architecture that learns a unitary weight matrix, with eigenvalues of absolute value exactly 1. The challenge we address is that of parametrizing unitary matrices in a way that does not require expensive computations (such as eigendecomposition) after each weight update. We construct an expressive unitary weight matrix by composing several structured matrices that act as building blocks with parameters to be learned. Optimization with this parameterization becomes feasible only when considering hidden states in the complex domain. We demonstrate the potential of this architecture by achieving state of the art results in several hard tasks involving very long-term dependencies.
  • Session chair: Honglak Lee

    Location: Ballroom 1+2+Juliard
  • 02:00 – Deep Speech 2 : End-to-End Speech Recognition in English and Mandarin Dario Amodei , Rishita Anubhai , Eric Battenberg , Carl Case , Jared Casper , Bryan Catanzaro , JingDong Chen , Mike Chrzanowski Baidu USA, Inc., Adam Coates , Greg Diamos Baidu USA, Inc., Erich Elsen Baidu USA, Inc., Jesse Engel , Linxi Fan , Christopher Fougner , Awni Hannun Baidu USA, Inc., Billy Jun , Tony Han , Patrick LeGresley , Xiangang Li Baidu, Libby Lin , Sharan Narang , Andrew Ng , Sherjil Ozair , Ryan Prenger , Sheng Qian Baidu, Jonathan Raiman , Sanjeev Satheesh Baidu SVAIL, David Seetapun , Shubho Sengupta , Chong Wang , Yi Wang , Zhiqian Wang , Bo Xiao , Yan Xie Baidu, Dani Yogatama , Jun Zhan , zhenyao Zhu Paper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    We show that an end-to-end deep learning approach can be used to recognize either English or Mandarin Chinese speech–two vastly different languages. Because it replaces entire pipelines of hand-engineered components with neural networks, end-to-end learning allows us to handle a diverse variety of speech including noisy environments, accents and different languages. Key to our approach is our application of HPC techniques, enabling experiments that previously took weeks to now run in days. This allows us to iterate more quickly to identify superior architectures and algorithms. As a result, in several cases, our system is competitive with the transcription of human workers when benchmarked on standard datasets. Finally, using a technique called Batch Dispatch with GPUs in the data center, we show that our system can be inexpensively deployed in an online setting, delivering low latency when serving users at scale.
  • 02:17 – Persistent RNNs: Stashing Recurrent Weights On-Chip Greg Diamos Baidu USA, Inc., Shubho Sengupta Baidu USA, Inc., Bryan Catanzaro Baidu USA, Inc., Mike Chrzanowski Baidu USA, Inc., Adam Coates , Erich Elsen Baidu USA, Inc., Jesse Engel Baidu USA, Inc., Awni Hannun Baidu USA, Inc., Sanjeev Satheesh Baidu USA, Inc.Paper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    This paper introduces a new technique for mapping Deep Recurrent Neural Networks (RNN) efficiently onto GPUs. We show how it is possi- ble to achieve substantially higher computational throughput at low mini-batch sizes than direct implementations of RNNs based on matrix multiplications. The key to our approach is the use of persistent computational kernels that exploit the GPU’s inverted memory hierarchy to reuse network weights over multiple timesteps. Our initial implementation sustains 2.8 TFLOP/s at a mini-batch size of 4 on an NVIDIA TitanX GPU. This provides a 16x reduction in activation memory footprint, enables model training with 12x more parameters on the same hardware, allows us to strongly scale RNN training to 128 GPUs, and allows us to efficiently explore end-to-end speech recognition models with over 100 layers.
  • 02:34 – Sequence to Sequence Training of CTC-RNNs with Partial Windowing Kyuyeon Hwang Seoul National University, Wonyong Sung Seoul National UniversityPaper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    Connectionist temporal classification (CTC) based supervised sequence training of recurrent neural networks (RNNs) has shown great success in many machine learning areas including end-to-end speech and handwritten character recognition. For the CTC training, however, it is required to unroll (or unfold) the RNN by the length of an input sequence. This unrolling requires a lot of memory and hinders a small footprint implementation of online learning or adaptation. Furthermore, the length of training sequences is usually not uniform, which makes parallel training with multiple sequences inefficient on shared memory models such as graphics processing units (GPUs). In this work, we introduce an expectation-maximization (EM) based online CTC algorithm that enables unidirectional RNNs to learn sequences that are longer than the amount of unrolling. The RNNs can also be trained to process an infinitely long input sequence without pre-segmentation or external reset. Moreover, the proposed approach allows efficient parallel training on GPUs. Our approach achieves 20.7% phoneme error rate (PER) on the very long input sequence that is generated by concatenating all 192 utterances in the TIMIT core test set. In the end-to-end speech recognition task on the Wall Street Journal corpus, a network can be trained with only 64 times of unrolling with little performance loss.
  • 03:10 – Analysis of Deep Neural Networks with Extended Data Jacobian Matrix Shengjie Wang University of Washington, Abdel-rahman Mohamed , Rich Caruana Microsoft, Jeff Bilmes U. of Washington, Matthai Plilipose , Matthew Richardson , Krzysztof Geras , Gregor Urban UC Irvine, Ozlem Aslan Paper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    Deep neural networks have achieved great successes on various machine learning tasks, however, there are many open fundamental questions to be answered. In this paper, we tackle the problem of quantifying the quality of learned wights of different networks with possibly different architectures, going beyond considering the final classification error as the only metric. We introduce \emph{Extended Data Jacobian Matrix} to help analyze properties of networks of various structures, finding that, the spectrum of the extended data jacobian matrix is a strong discriminating factor for networks of different structures and performance. Based on such observation, we propose a novel regularization method, which manages to improve the network performance comparably to dropout, which in turn verifies the observation.
  • 03:27 – Understanding and Improving Convolutional Neural Networks via Concatenated Rectified Linear Units Wenling Shang , Kihyuk Sohn NEC Laboratories America, Diogo Almeida Enlitic, Honglak Lee University of MichiganPaper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    Recently, convolutional neural networks (CNNs) have been used as a powerful tool to solve many problems of machine learning and computer vision. In this paper, we aim to provide insight on the property of convolutional neural networks, as well as a generic method to improve the performance of many CNN architectures. Specifically, we first examine existing CNN models and observe an intriguing property that the filters in the lower layers form pairs (i.e., filters with opposite phase). Inspired by our observation, we propose a novel, simple yet effective activation scheme called concatenated ReLU (CReLU) and theoretically analyze its reconstruction property in CNNs. We integrate CReLU into several state-of-the-art CNN architectures and demonstrate improvement in their recognition performance on CIFAR-10/100 and ImageNet datasets with fewer trainable parameters. Our results suggest that better understanding of the properties of CNNs can lead to significant performance improvement with a simple modification.
  • Best paper award – 03:44 – Pixel Recurrent Neural Networks Aaron Van den Oord Google Deepmind, Nal Kalchbrenner Google Deepmind, Koray Kavukcuoglu Google DeepmindPaper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    Modeling the distribution of natural images is a landmark problem in unsupervised learning.
    This task requires an image model that is at once expressive, tractable and scalable. We present a deep neural network that sequentially predicts the pixels in an image along the two spatial dimensions. Our method models the discrete probability of the raw pixel values and encodes the complete set of dependencies in the image. Architectural novelties include fast two-dimensional recurrent layers and an effective use of residual connections in deep recurrent networks. We achieve log-likelihood scores on natural images that are considerably better than the previous state of the art. Our main results also provide benchmarks on the diverse ImageNet dataset. Samples generated from the model appear crisp, varied and globally coherent.
  • Monday – Reinforcement Learning

    Session chair: Joelle Pineau

    Location: Ballroom 3+4
  • 10:20 – Why Most Decisions Are Easy in Tetris—And Perhaps in Other Sequential Decision Problems, As Well Ozgur Simsek , Simon Algorta , Amit Kothiyal Paper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    We examined the sequence of decision problems that are encountered in the game of Tetris and found that most of the problems are easy in the following sense: One can choose well among the available actions without knowing an evaluation function that scores well in the game. This is a consequence of three conditions that are prevalent in the game: simple dominance, cumulative dominance, and noncompensation. These conditions can be exploited to develop faster and more effective learning algorithms. In addition, they allow certain types of domain knowledge to be incorporated with ease into a learning algorithm. Among the sequential decision problems we encounter, it is unlikely that Tetris is unique or rare in having these properties.
  • 10:37 – Opponent Modeling in Deep Reinforcement Learning He He , Jordan , Kevin Kwok Massachusetts Institute of Technology, Hal Daume MarylandPaper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    Opponent modeling is necessary in multi-agent settings where
    secondary agents with competing goals also adapt their strategies,
    yet it remains challenging because of strategies’ complex interaction
    and the non-stationary nature. Most previous work focuses on
    developing probabilistic models or parameterized strategies for
    specific applications. Inspired by the recent success of deep
    reinforcement learning, we present neural-based models that jointly
    learn a policy and the behavior of opponents. Instead of explicitly
    predicting the opponent’s action, we encode observation of the
    opponents into a deep Q-Network (DQN), while retaining
    explicit modeling under multitasking. By using a Mixture-of-Experts
    architecture, our model automatically discovers different strategy
    patterns of opponents even without extra supervision. We
    evaluate our models on a simulated soccer game and a popular trivia
    game, showing superior performance over DQN and its variants.
  • 10:54 – Control of Memory, Active Perception, and Action in Minecraft Junhyuk Oh University of Michigan, Valliappa Chockalingam University of Michigan, Satinder , Honglak Lee University of MichiganPaper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    In this paper, we introduce a new set of reinforcement learning (RL) tasks in Minecraft (a flexible 3D world). We then use these tasks to systematically compare and contrast existing deep reinforcement learning (DRL) architectures with our new memory-based DRL architectures. These tasks are designed to emphasize, in a controllable manner, issues that pose challenges for RL methods including partial observability (due to first-person visual observations), delayed rewards, high-dimensional visual observations, and the need to use active perception in a correct manner so as to perform well in the tasks. While these tasks are conceptually simple to describe, by virtue of having all of these challenges simultaneously they are difficult for current DRL architectures. Additionally, we evaluate the generalization performance of the architectures on environments not used during training. The experimental results show that our new architectures generalize to unseen environments better than existing DRL architectures.
  • 11:30 – Graying the black box: Understanding DQNs Tom Zahavy Technion, Nir Ben-Zrihem , Shie Mannor TechnionPaper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    In recent years there is a growing interest in using deep representations for reinforcement learning. In this paper, we present a methodology and tools to analyze Deep Q-networks (DQNs) in a non-blind matter. Using our tools we reveal that the features learned by DQNs aggregate the state space in a hierarchical fashion, explaining its success. Moreover we are able to understand and describe the policies learned by DQNs for three different Atari2600 games and suggest ways to interpret, debug and optimize of deep neural networks in Reinforcement Learning.
  • 11:47 – Benchmarking Deep Reinforcement Learning for Continuous Control Yan Duan University of California, Berk, Xi Chen University of California, Berkeley, Rein Houthooft Ghent University, John Schulman University of California, Berkeley, Pieter Abbeel BerkeleyPaper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    Recently, researchers have made significant progress combining the advances in deep learning for learning feature representations with reinforcement learning. Some notable examples include training agents to play Atari games based on raw pixel data and to acquire advanced manipulation skills using raw sensory inputs. However, it has been difficult to quantify progress in the domain of continuous control due to the lack of a commonly adopted benchmark. In this work, we present a benchmark suite of continuous control tasks, including classic tasks like cart-pole swing-up, tasks with very high state and action dimensionality such as 3D humanoid locomotion, tasks with partial observations, and tasks with hierarchical structure. We report novel findings based on the systematic evaluation of a range of implemented reinforcement learning algorithms. Both the benchmark and reference implementations are released at https://github.com/rllab/rllab in order to facilitate experimental reproducibility and to encourage adoption by other researchers.
  • Best paper award – 12:04 – Dueling Network Architectures for Deep Reinforcement Learning Ziyu Wang Google Inc., Tom Schaul Google Inc., Matteo Hessel Google Deepmind, Hado van Hasselt Google DeepMind, Marc Lanctot Google Deepmind, Nando de Freitas University of OxfordPaper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    In recent years there have been many successes of using deep representations in reinforcement learning. Still, many of these applications use conventional architectures, such as convolutional networks, LSTMs, or auto-encoders. In this paper, we present a new neural network architecture for model-free reinforcement learning. Our dueling network represents two separate estimators: one for the state value function and one for the state-dependent action advantage function. The main benefit of this factoring is to generalize learning across actions without imposing any change to the underlying reinforcement learning algorithm. Our results show that this architecture leads to better policy evaluation in the presence of many similar-valued actions. Moreover, the dueling architecture enables our RL agent to outperform the state-of-the-art on the Atari 2600 domain.
  • Monday – Optimization (Continuous)

    Session chair: Sebastien Bubeck

    Location: Marquis
  • 10:20 – SDCA without Duality, Regularization, and Individual Convexity Shai Shalev-Shwartz Hebrew University of JerusalemPaper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    Stochastic Dual Coordinate Ascent is a popular method for solving regularized loss minimization for the case of convex losses. We describe variants of SDCA that do not require explicit regularization and do not rely on duality. We prove linear convergence rates even if individual loss functions are non-convex, as long as the expected loss is strongly convex.
  • 10:37 – Stochastic Variance Reduction for Nonconvex Optimization Sashank J. Reddi Carnegie Mellon University, Ahmed Hefny , Suvrit Sra , Barnabas Poczos , Alex Paper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    We study nonconvex finite-sum problems and
    analyze stochastic variance reduced gradient
    (SVRG) methods for them. SVRG and related
    methods have recently surged into prominence
    for convex optimization given their edge over
    stochastic gradient descent (SGD); but their theoretical
    analysis almost exclusively assumes convexity.
    In contrast, we prove non-asymptotic
    rates of convergence (to stationary points) of
    SVRG for nonconvex optimization, and show that
    it is provably faster than SGD and gradient descent.
    We also analyze a subclass of nonconvex
    problems on which SVRG attains linear convergence
    to the global optimum. We extend
    our analysis to mini-batch variants of SVRG,
    showing (theoretical) linear speedup due to minibatching
    in parallel settings.
  • 10:54 – Fast Rate Analysis of Some Stochastic Optimization Algorithms Chao Qu Nus, Huan Xu National University of Singapore, Chong jin Ong NusPaper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    In this paper, we revisit three fundamental and popular stochastic optimization algorithms (namely, Online Proximal Gradient, Regularized Dual Averaging method and ADMM with online proximal gradient) and analyze their convergence speed under conditions weaker than those in literature. In particular, previous works showed that these algorithms converge at a rate of $O (\ln T/T)$ when the loss function is strongly convex, and $O (1 /\sqrt{T})$ in the weakly convex case. In contrast, we relax the strong convexity assumption of the loss function, and show that the algorithms converge at a rate $O (\ln T/T)$ if the {\em expectation} of the loss function is {\em locally} strongly convex. This is a much weaker assumption and is satisfied by many practical formulations including Lasso and Logistic Regression. Our analysis thus extends the applicability of these three methods, as well as provides a general recipe for improving analysis of convergence rate for stochastic and online optimization algorithms.
  • 11:30 – Black-box Optimization with a Politician Sebastien Bubeck Microsoft, Yin Tat Lee MITPaper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    We propose a new framework for black-box convex optimization which is well-suited for situations where gradient computations are expensive. We derive a new method for this framework which leverages several concepts from convex optimization, from standard first-order methods (e.g. gradient descent or quasi-Newton methods) to analytical centers (i.e. minimizers of self-concordant barriers). We demonstrate empirically that our new technique compares favorably with state of the art algorithms (such as BFGS).
  • 11:47 – Starting Small – Learning with Adaptive Sample Sizes Hadi Daneshmand ETH Zurich, Aurelien Lucchi ETHZ, Thomas Hofmann Paper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    For many machine learning problems, data is abundant and it may be prohibitive to make multiple passes through the full training set. In this context, we investigate strategies for dynamically increasing the effective sample size, when using iterative methods such as stochastic gradient descent. Our interest is motivated by the rise of variance-reduced methods, which achieve linear convergence rates that scale favorably for smaller sample sizes. Exploiting this feature, we show – theoretically and empirically – how to obtain significant speed-ups with a novel algorithm that reaches statistical accuracy on an n-sample in 2n, instead of n log n steps.
  • 12:04 – Primal-Dual Rates and Certificates Celestine Dünner IBM Research, Simone Forte Google, Martin Takac , Martin Jaggi Paper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    We propose an algorithm-independent framework to equip existing optimization methods with primal-dual certificates. Such certificates and corresponding rate of convergence guarantees are important for practitioners to diagnose progress, in particular in machine learning applications.
    We obtain new primal-dual convergence rates, e.g., for the Lasso as well as many L1, Elastic Net, group Lasso and TV-regularized problems. The theory applies to any norm-regularized generalized linear model. Our approach provides efficiently computable duality gaps which are globally defined, without modifying the original problems in the region of interest.
  • Monday – Online Learning

    Session chair: Alina Beygelzimer

    Location: Lyceum
  • 10:20 – Online Learning with Feedback Graphs Without the Graphs Alon Cohen Technion, Tamir Hazan , Tomer Koren Paper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    We study an online learning framework introduced by Mannor and Shamir (2011) in which the feedback is specified by a graph, in a setting where the graph may vary from round to round and is \emph{never fully revealed} to the learner.
    We show a large gap between the adversarial and the stochastic cases.
    In the adversarial case, we prove that even for dense feedback graphs, the learner cannot improve upon a trivial regret bound obtained by ignoring any additional feedback besides her own loss.
    In contrast, in the stochastic case we give an algorithm that achieves $\widetilde{\Theta}(\sqrt{\alpha T})$ regret over $T$ rounds, provided that the independence numbers of the hidden feedback graphs are at most $\alpha$.
    We also extend our results to a more general feedback model, in which the learner does not necessarily observe her own loss, and show that, even in simple cases, concealing the feedback graphs might render the problem unlearnable.
  • 10:37 – Efficient Algorithms for Adversarial Contextual Learning Vasilis Syrgkanis Microsoft Research, Akshay Krishnamurthy Microsoft Research, Robert Schapire Microsoft ResearchPaper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    We provide the first oracle efficient sublinear regret algorithms for adversarial versions of the contextual bandit problem. In this problem, the learner repeatedly makes an action on the basis of a context and receives reward for the chosen action, with the goal of achieving reward competitive with a large class of policies. We analyze two settings: i) in the transductive setting the learner knows the set of contexts a priori, ii) in the small separator setting, there exists a small set of contexts such that any two policies behave differently on one of the contexts in the set. Our algorithms fall into the Follow-The-Perturbed-Leader family (Kalai and Vempala, 2005) and achieve regret O(T^{3/4}\sqrt{K\log(N)}) in the transductive setting and O(T^{2/3} d^{3/4} K\sqrt{\log(N)}) in the separator setting, where T is the number of rounds, K is the number of actions, N is the number of baseline policies, and d is the size of the separator. We actually solve the more general adversarial contextual semi-bandit linear optimization problem, whilst in the full information setting we address the even more general contextual combinatorial optimization. We provide several extensions and implications of our algorithms, such as switching regret and efficient learning with predictable sequences.
  • 10:54 – BISTRO: An Efficient Relaxation-Based Method for Contextual Bandits Alexander Rakhlin , Karthik Sridharan CornellPaper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    We present efficient algorithms for the problem of contextual bandits with i.i.d. covariates, an arbitrary sequence of rewards, and an arbitrary class of policies. Our algorithm BISTRO requires d calls to the empirical risk minimization (ERM) oracle per round, where d is the number of actions. The method uses unlabeled data to make the problem computationally simple. When the ERM problem itself is computationally hard, we extend the approach by employing multiplicative approximation algorithms for the ERM. The integrality gap of the relaxation only enters in the regret bound rather than the benchmark. Finally, we show that the adversarial version of the contextual bandit problem is learnable (and efficient) whenever the full-information supervised online learning problem has a non-trivial regret bound (and efficient).
  • 11:30 – Online Stochastic Linear Optimization under One-bit Feedback Lijun Zhang Nanjing University, Tianbao Yang University of Iowa, Rong Jin Alibaba Group, Yichi Xiao Nanjing University, Zhi-hua Zhou Paper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    In this paper, we study a special bandit setting of online stochastic linear optimization, where only one-bit of information is revealed to the learner at each round. This problem has found many applications including online advertisement and online recommendation. We assume the binary feedback is a random variable generated from the logit model, and aim to minimize the regret defined by the unknown linear function. Although the existing method for generalized linear bandit can be applied to our problem, the high computational cost makes it impractical for real-world applications. To address this challenge, we develop an efficient online learning algorithm by exploiting particular structures of the observation model. Specifically, we adopt online Newton step to estimate the unknown parameter and derive a tight confidence region based on the exponential concavity of the logistic loss. Our analysis shows that the proposed algorithm achieves a regret bound of $O(d\sqrt{T})$, which matches the optimal result of stochastic linear bandits.
  • 11:47 – Tracking Slowly Moving Clairvoyant: Optimal Dynamic Regret of Online Learning with True and Noisy Gradient Tianbao Yang University of Iowa, Lijun Zhang Nanjing University, Rong Jin , Jinfeng Yi IBM ResearchPaper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    This work focuses on dynamic regret of online convex optimization that compares the performance of online learning to a clairvoyant who knows the sequence of loss functions in advance and hence selects the minimizer of the loss function at each step. By assuming that the clairvoyant moves slowly (i.e., the minimizers change slowly), we present several improved variation-based upper bounds of the dynamic regret under the true and noisy gradient feedback, which are {\it optimal} in light of the presented lower bounds. The key to our analysis is to explore a regularity metric that measures the temporal changes in the clairvoyant’s minimizers, to which we refer as path variation. Firstly, we present a general lower bound in terms of the path variation, and then show that under full information or gradient feedback we are able to achieve an optimal dynamic regret. Secondly, we present a lower bound with noisy gradient feedback and then show that we can achieve optimal dynamic regrets under a stochastic gradient feedback and two-point bandit feedback. Moreover, for a sequence of smooth loss functions that admit a small variation in the gradients, our dynamic regret under the two-point bandit feedback matches that is achieved with full information.
  • 12:04 – Adaptive Algorithms for Online Convex Optimization with Long-term Constraints Rodolphe Jenatton , Jim Huang Amazon, Cedric Archambeau Paper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    We present an adaptive online gradient descent algorithm to solve online convex optimization problems with long-term constraints, which are constraints that need to be satisfied when accumulated over a finite number of rounds T, but can be violated in intermediate rounds. For some user-defined trade-off parameter \beta in (0, 1), the proposed algorithm achieves cumulative regret bounds of O(T^max{\beta,1−\beta}) and O(T^{1−\beta/2}), respectively for the loss and the constraint violations. Our results hold for convex losses, can handle arbitrary convex constraints and rely on a single computationally efficient algorithm. Our contributions improve over the best known cumulative regret bounds of Mahdavi et al. (2012), which are respectively O(T^1/2) and O(T^3/4) for general convex domains, and respectively O(T^2/3) and O(T^2/3) when the domain is further restricted to be a polyhedral set. We supplement the analysis with experiments validating the performance of our algorithm in practice.
  • Session chair: Csaba Szepesvari

    Location: Liberty
  • 04:15 – Pricing a Low-regret Seller Hoda Heidari , Mohammad Mahdian Google, Umar Syed , Sergei Vassilvitskii , Sadra Yazdanbod Georgia Institute of TechnologyPaper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    As the number of ad exchanges has grown, publishers have turned to low regret learning algorithms to decide which exchange offers the best price for their inventory. This in turn opens the following question for the exchange: how to set prices to attract as many sellers as possible and maximize revenue. In this work we formulate this precisely as a learning problem, and present algorithms showing that by simply knowing that the counterparty is using a low regret algorithm is enough for the exchange to have its own low regret learning algorithm to find the optimal price.
  • 04:32 – Multi-Player Bandits — a Musical Chairs Approach Jonathan Rosenski Weizmann Institute of Science, Ohad Shamir Weizmann Institute of Science, Liran Szlak Weizmann Institute of SciencePaper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    We consider a variant of the stochastic multi-armed bandit problem, where multiple players simultaneously choose from the same set of arms and may collide, receiving no reward. This setting has been motivated by problems arising in cognitive radio networks, and is especially challenging under the realistic assumption that communication between players is limited. We provide a communication-free algorithm (Musical Chairs) which attains constant regret with high probability, as well as a sublinear-regret, communication-free algorithm (Dynamic Musical Chairs) for the more difficult setting of players dynamically entering and leaving throughout the game. Moreover, both algorithms do not require prior knowledge of the number of players. To the best of our knowledge, these are the first communication-free algorithms with these types of formal guarantees.
  • 04:49 – Contextual Combinatorial Cascading Bandits Shuai Li CUHK, Baoxiang Wang , Shengyu Zhang , Wei Chen Paper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    We propose the contextual combinatorial cascading bandits, a combinatorial online learning game, where at each time step a learning agent is given a set of contextual information, then selects a list of items, and observes stochastic outcomes of a prefix in the selected items by some stopping criterion. In online recommendation, the stopping criterion might be the first item a user selects; in network routing, the stopping criterion might be the first edge blocked in a path. We consider position discounts in the list order, so that the agent’s reward is discounted depending on the position where the stopping criterion is met. We design a UCB-type algorithm, C$^3$-UCB, for this problem, prove an $n$-step regret bound $\tilde{O}(\sqrt{n})$ in the general setting, and give finer analysis for two special cases. Our work generalizes existing studies in several directions, including contextual information, position discounts, and a more general cascading bandit model. Experiments on synthetic and real datasets demonstrate the advantage of involving contextual information and position discounts.
  • 05:25 – Copeland Dueling Bandit Problem: Regret Lower Bound, Optimal Algorithm, and Computationally Efficient Algorithm Junpei Komiyama The University of Tokyo, Junya Honda The University of Tokyo, Hiroshi Nakagawa The University of TokyoPaper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    We study the K-armed dueling bandit problem, a variation of the standard stochastic bandit problem where the feedback is limited to relative comparisons of a pair of arms. The hardness of recommending Copeland winners, the arms that beat the greatest number of other arms, is characterized by deriving an asymptotic regret bound. We propose Copeland Winners Deterministic Minimum Empirical Divergence (CW-RMED), an algorithm inspired by the DMED algorithm (Honda and Takemura, 2010), and derive an asymptotically optimal regret bound for it. However, it is not known whether the algorithm can be efficiently computed or not. To address this issue, we devise an efficient version (ECW-RMED) and derive its asymptotic regret bound. Experimental comparisons of dueling bandit algorithms show that ECW-RMED significantly outperforms existing ones.
  • 05:42 – DCM Bandits: Learning to Rank with Multiple Clicks Sumeet Katariya University of Wisconsin Madiso, Branislav Kveton Adobe Research, Csaba Szepesvari Alberta, Zheng Wen Paper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    A search engine recommends to the user a list of web pages. The user examines this list, from the first page to the last, and clicks on all attractive pages until the user is satisfied. This behavior of the user can be described by the dependent click model (DCM). We propose DCM bandits, an online learning variant of the DCM where the goal is to maximize the probability of recommending satisfactory items, such as web pages. The main challenge of our learning problem is that we do not observe which attractive item is satisfactory. We propose a computationally-efficient learning algorithm for solving our problem, dcmKL-UCB; derive gap-dependent upper bounds on its regret under reasonable assumptions; and also prove a matching lower bound up to logarithmic factors. We evaluate our algorithm on synthetic and real-world problems, and show that it performs well even when our model is misspecified. This work presents the first practical and regret-optimal online algorithm for learning to rank with multiple clicks in a cascade-like click model.
  • 05:59 – Distributed Clustering of Linear Bandits in Peer to Peer Networks Nathan Korda University of Oxford, Balazs Szorenyi , Shuai Li University of InsubriaPaper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    We provide two distributed confidence ball algorithms for solving linear bandit problems in peer to peer networks with limited communication capabilities. For the first, we assume that all the peers are solving the same linear bandit problem, and prove that our algorithm achieves the optimal asymptotic regret rate of any centralised algorithm that can instantly communicate information between the peers. For the second, we assume that there are clusters of peers solving the same bandit problem within each cluster, and we prove that our algorithm discovers these clusters, while achieving the optimal asymptotic regret rate within each one. Through experiments on several real-world datasets, we demonstrate the performance of proposed algorithms compared to the state-of-the-art.
  • Monday – Clustering

    Session chair: Alexandru Niculescu-Mizil

    Location: Empire
  • 10:20 – Correlation Clustering and Biclustering with Locally Bounded Errors Gregory Puleo UIUC, Olgica Milenkovic UIUCPaper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    We consider a generalized version of the correlation clustering problem, defined as follows. Given a complete graph $G$ whose edges are labeled with $+$ or $-$, we wish to partition the graph into clusters while trying to avoid errors: $+$ edges between clusters or $-$ edges within clusters. Classically, one seeks to minimize the total number of such errors. We introduce a new framework that allows the objective to be a more general function of the number of errors at each vertex (for example, we may wish to minimize the number of errors at the worst vertex) and provide a rounding algorithm which converts “fractional clusterings” into discrete clusterings while causing only a constant-factor blowup in the number of errors at each vertex. This rounding algorithm yields constant-factor approximation algorithms for the discrete problem under a wide variety of objective functions.
  • 10:37 – $K$-Means Clustering with Distributed Dimensions Hu Ding State University of New York at Buffalo, Yu Liu Tsinghua University, IIIS, Lingxiao Huang , Jian Li Paper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    Distributed clustering has attracted significant attention in recent years. In this paper, we study the $k$-means problem in the distributed dimension setting, where the dimensions of the data are partitioned across multiple machines. We provide new approximation algorithms, which incur low communication costs and achieve constant approximation ratios. The communication complexity of our algorithms significantly improve on existing algorithms. We also provide the first communication lower bound, which nearly matches our upper bound in a certain range of parameter setting. Our experimental results show that our algorithms outperform existing algorithms on real data-sets in the distributed dimension setting.
  • 10:54 – Speeding up k-means by approximating Euclidean distances via block vectors Thomas Bottesch Ulm University, Thomas Bühler Avira, Markus Kächele Ulm UniversityPaper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    This paper introduces a new method to approximate Euclidean distances between points using block vectors in combination with the Hölder inequality. By defining lower bounds based on the proposed approximation, cluster algorithms can be considerably accelerated without loss of quality. In extensive experiments, we show a considerable reduction in terms of computational time in comparison to standard methods and the recently proposed Yinyang k-means. Additionally we show that the memory consumption of the presented clustering algorithm does not depend on the number of clusters, which makes the approach suitable for large scale problems.
  • 11:30 – Fast k-means with accurate bounds James Newling Idiap Research Institute, Francois Fleuret Idiap research institutePaper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    We propose a novel accelerated exact k-means algorithm, which outperforms the current state-of-the-art low-dimensional algorithm in 18 of 22 experiments, running up to 3 times faster. We also propose a general improvement of existing state-of-the-art accelerated exact k-means algorithms through better estimates of the distance bounds used to reduce the number of distance calculations, obtaining speedups in 36 of 44 experiments, of up to 1.8 times. We have conducted experiments with our own implementations of existing methods to ensure homogeneous evaluation of performance, and we show that our implementations perform as well or better than existing available implementations. Finally, we propose simplified variants of standard approaches and show that they are faster than their fully-fledged counterparts in 59 of 62 experiments.
  • 11:47 – k-variates++: more pluses in the k-means++ Richard Nock Nicta & ANU, Raphael Canyasse Ecole Polytechnique and The Technion, Roksana Boreli Data61, Frank Nielsen Ecole Polytechnique and Sony CS Labs Inc.Paper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    $k$-means++ seeding has become a de facto standard
    for hard clustering algorithms. In this paper, our first
    contribution is a two-way generalisation of this seeding, $k$-variates++, that includes the sampling of general densities
    rather than just a discrete set of Dirac densities anchored at the point
    locations, \textit{and} a generalisation of the
    well known Arthur-Vassilvitskii (AV) approximation
    guarantee, in the form of a \textit{bias+variance} approximation bound of
    the \textit{global} optimum. This approximation exhibits a reduced dependency on the “noise”
    component with respect to the optimal potential — actually approaching the
    statistical lower bound. We show that $k$-variates++ \textit{reduces} to efficient (biased seeding) clustering algorithms tailored to specific frameworks; these include distributed, streaming and on-line clustering, with \textit{direct} approximation results for these algorithms.
    Finally, we present a novel
    application of $k$-variates++ to differential privacy.
    For either the specific frameworks considered here, or for the
    differential privacy setting, there is little to no prior results on the
    direct application of $k$-means++ and its approximation bounds —
    state of the art contenders appear to be significantly more complex
    and / or display less favorable (approximation) properties.
    We stress that our algorithms can still be run in
    cases where there is \textit{no} closed form solution for the population minimizer.
    We demonstrate the applicability of our analysis via experimental
    evaluation on several domains and settings, displaying competitive performances vs state of the art.
  • 12:04 – Compressive Spectral Clustering Nicolas TREMBLAY INRIA Rennes, Gilles Puy Technicolor, Remi Gribonval INRIA, Pierre Vandergheynst EPFLPaper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    Spectral clustering has become a popular technique due to its high performance in many contexts. It comprises three main steps: create a similarity graph between N objects to cluster, compute the first k eigenvectors of its Laplacian matrix to define a feature vector for each object, and run k-means on these features to separate objects into k classes. Each of these three steps becomes computationally intensive for large N and/or k. We propose to speed up the last two steps based on recent results in the emerging field of graph signal processing: graph filtering of random signals, and random sampling of bandlimited graph signals. We prove that our method, with a gain in computation time that can reach several orders of magnitude, is in fact an approximation of spectral clustering, for which we are able to control the error. We test the performance of our method on artificial and real-world network data.
  • Monday – Bayesian Nonparametric Methods

    Session chair: Hal Daume III

    Location: Soho
  • 10:20 – On collapsed representation of hierarchical Completely Random Measures Gaurav Pandey Indian Institute of Science, Ambedkar Dukkipati Indian Institute of SciencePaper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    The aim of the paper is to provide an exact approach for generating a Poisson process sampled from a hierarchical CRM, without having to instantiate the infinitely many atoms of the random measures.
    We use completely random measures~(CRM) and hierarchical CRM to define a prior for Poisson processes. We derive the marginal distribution of the resultant point process, when the underlying CRM is marginalized out. Using well known properties unique to Poisson processes, we were able to derive an exact approach for instantiating a Poisson process with a hierarchical CRM prior. Furthermore, we derive Gibbs sampling strategies for hierarchical CRM models based on Chinese restaurant franchise sampling scheme. As an example, we present the sum of generalized gamma process (SGGP), and show its application in topic-modelling. We show that one can determine the power-law behaviour of the topics and words in a Bayesian fashion, by defining a prior on the parameters of SGGP.
  • 10:37 – Hawkes Processes with Stochastic Excitations Young Lee NICTA, Kar Wai Lim ANU, Cheng Soon Ong NICTAPaper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    We propose an extension to Hawkes processes by treating the levels of self-excitation as a stochastic differential equation. Our new point process allows better approximation in application domains where events and intensities accelerate each other with correlated levels of contagion. We generalize a recent algorithm for simulating draws from Hawkes processes whose levels of excitation are stochastic processes, and propose a hybrid Markov chain Monte Carlo approach for model fitting. Our sampling procedure scales linearly with the number of required events and does not require stationarity of the point process. A modular inference procedure consisting of a combination between Gibbs and Metropolis Hastings steps is put forward. We recover expectation maximization as a special case. Our general approach is illustrated for contagion following geometric Brownian motion and exponential Langevin dynamics.
  • 10:54 – The Segmented iHMM: A Simple, Efficient Hierarchical Infinite HMM Ardavan Saeedi MIT, Matthew Hoffman Adobe Research, Matthew Johnson , Ryan Adams HarvardPaper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    We propose the segmented iHMM (siHMM), a hierarchical infinite hidden Markov model (iHMM) that supports a simple, efficient inference scheme. The siHMM is well suited to segmentation problems, where the goal is to identify points at which a time series transitions from one relatively stable regime to a new regime. Conventional iHMMs often struggle with such problems, since they have no mechanism for distinguishing between high-and low-level dynamics. Hierarchical HMMs (HHMMs) can do better, but they require much more complex and expensive inference algorithms. The siHMM retains the simplicity and efficiency of the iHMM, but outperforms it on a variety of segmentation problems, achieving performance that matches or exceeds that of a more complicated HHMM.
  • 11:30 – Markov Latent Feature Models Aonan Zhang Columbia University, John Paisley Paper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    We introduce Markov latent feature models (MLFM), a sparse latent feature model that arises naturally from a simple sequential construction. The key idea is to interpret each state of a sequential process as corresponding to a latent feature, and the set of states visited between two null-state visits as picking out features for an observation. We show that, given some natural constraints, we can represent this stochastic process as a mixture of recurrent Markov chains. In this way we can perform correlated latent feature modeling for the sparse coding problem. We demonstrate two cases in which we define finite and infinite latent feature models constructed from first-order Markov chains, and derive their associated scalable inference algorithms. We show empirical results on a genome analysis task and an image denoising task.
  • 11:47 – Diversity-Promoting Bayesian Learning of Latent Variable Models Pengtao Xie Carnegie Mellon University, Jun Zhu Tsinghua, Eric Xing CMUPaper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    In learning latent variable models (LVMs), it is important to effectively capture infrequent patterns and shrink model size without sacrificing modeling power. Various studies have been done to “diversify” a LVM, which aim to learn a diverse set of latent components in LVMs. Most existing studies fall into a frequentist-style regularization framework, where the components are learned via point estimation. In this paper, we investigate how to “diversify” LVMs in the paradigm of Bayesian learning, which has advantages complementary to point estimation, such as alleviating overfitting via model averaging and quantifying uncertainty. We propose two approaches that have complementary advantages. One is to define diversity-promoting mutual angular priors which assign larger density to components with larger mutual angles based on Bayesian network and von Mises-Fisher distribution and use these priors to affect the posterior via Bayes rule. We develop two efficient approximate posterior inference algorithms based on variational inference and Markov chain Monte Carlo sampling. The other approach is to impose diversity-promoting regularization directly over the post-data distribution of components. These two methods are applied to the Bayesian mixture of experts model to encourage the “experts” to be diverse and experimental results demonstrate the effectiveness and efficiency of our methods.
  • 12:04 – Bayesian Poisson Tucker Decomposition for Learning the Structure of International Relations Aaron Schein , Mingyuan Zhou , Blei David Columbia, Hanna Wallach MicrosoftPaper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    We introduce Bayesian Poisson Tucker decomposition (BPTD) for modeling country–country interaction event data. These data consist of interaction events of the form “country $i$ took action $a$ toward country $j$ at time $t$.” BPTD discovers overlapping country–community memberships, including the number of latent communities. In addition, it discovers directed community–community interaction networks that are specific to “topics” of action types and temporal “regimes.” We show that BPTD yields an efficient MCMC inference algorithm and achieves better predictive performance than related models. We also demonstrate that it discovers interpretable latent structure that agrees with our knowledge of international relations.
  • Monday – Matrix Factorization / Neuroscience Applications

    Session chair: Jennifer Dy

    Location: Liberty
  • 10:20 – The knockoff filter for FDR control in group-sparse and multitask regression Ran Dai The University of Chicago, Rina Barber The University of ChicagoPaper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    We propose the group knockoff filter, a method for false discovery rate control in a linear regression setting where the features are grouped, and we would like to select a set of relevant groups which have a nonzero effect on the response. By considering the set of true and false discoveries at the group level, this method gains power relative to sparse regression methods. We also apply our method to the multitask regression problem where multiple response variables share similar sparsity patterns across the set of possible features. Empirically, the group knockoff filter successfully controls false discoveries at the group level in both settings, with substantially more discoveries made by leveraging the group structure.
  • 10:37 – A Simple and Provable Algorithm for Sparse Diagonal CCA Megasthenis Asteris University of Texas at Austin, Anastasios Kyrillidis , Oluwasanmi Koyejo Stanford University & University of Illinois at Urbana Champaign, Russell Poldrack Stanford UniversityPaper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    Given two sets of variables, derived from a common set of samples,
    sparse Canonical Correlation Analysis (CCA)
    seeks linear combinations of a small number of variables in each set,
    such that the induced \emph{canonical} variables are maximally correlated.
    Sparse CCA is NP-hard.

    We propose a novel combinatorial algorithm for sparse diagonal CCA,
    \textit{i.e.}, sparse CCA under the additional assumption that variables within each set are standardized and uncorrelated.
    Our algorithm operates on a low rank approximation of the input data and its computational complexity scales linearly with the number of input variables.
    It is simple to implement, and parallelizable.
    In contrast to most existing approaches,
    our algorithm administers precise control on the sparsity of the extracted canonical vectors,
    and comes with theoretical data-dependent global approximation guarantees, that hinge on the spectrum of the input data.
    Finally, it can be straightforwardly adapted to other constrained variants of CCA enforcing structure beyond sparsity.

    We empirically evaluate the proposed scheme
    and apply it on a real neuroimaging dataset to investigate associations between brain activity and behavior measurements.

  • 10:54 – Experimental Design on a Budget for Sparse Linear Models and Applications Sathya Narayanan Ravi UW Madison, Vamsi Ithapu UW Madison, Sterling Johnson UW Madison, Vikas Singh Paper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    Budget constrained optimal design of experiments is a classical problem in statistics. Although the optimal design literature is very mature, few efficient strategies are available when these design problems appear in the context of sparse linear models commonly encountered in high dimensional machine learning and statistics. In this work, we study experimental design for the setting where the underlying regression model is characterized by a $\ell_1$-regularized linear function. We propose two novel strategies: the first is motivated geometrically whereas the second is algebraic in nature. We obtain tractable algorithms for this problem and also hold for a more general class of sparse linear models. We perform an extensive set of experiments, on benchmarks and a large multi-site neuroscience study, showing that the proposed models are effective in practice. The latter experiment suggests that these ideas may play a small role in informing enrollment strategies for similar scientific studies in the short-to-medium term future.
  • 11:30 – Representational Similarity Learning with Application to Brain Networks Urvashi Oswal University of Wisconsin, Christopher Cox University of Wisconsin, Matthew Lambon-Ralph , Timothy Rogers University of Wisconsin, Robert Nowak Paper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    Representational Similarity Learning (RSL) aims to discover features that are important in representing (human-judged) similarities among objects. RSL can be posed as a sparsity-regularized multi-task regression problem. Standard methods, like group lasso, may not select important features if they are strongly correlated with others. To address this shortcoming we present a new regularizer for multitask regression called Group Ordered Weighted $\ell_1$ (GrOWL). Another key contribution of our paper is a novel application to fMRI brain imaging. Representational Similarity Analysis (RSA) is a tool for testing whether localized brain regions encode perceptual similarities. Using GrOWL, we propose a new approach called Network RSA that can discover arbitrarily structured brain networks (possibly widely distributed and non-local) that encode similarity information. We show, in theory and fMRI experiments, how GrOWL deals with strongly correlated covariates.
  • 11:47 – Dictionary Learning for Massive Matrix Factorization Arthur Mensch Inria, Julien Mairal , Bertrand Thirion Inria, Gael Varoquaux Paper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    Sparse matrix factorization is a popular tool to obtain interpretable data decompositions, which are also effective to perform data completion or denoising. Its applicability to large datasets has been addressed with online and randomized methods, that reduce the complexity in one of the matrix dimension, but not in both of them. In this paper, we tackle very large matrices in both dimensions. We propose a new factorization method that scales gracefully to terabyte-scale datasets. Those could not be processed by previous algorithms in a reasonable amount of time. We demonstrate the efficiency of our approach on massive functional Magnetic Resonance Imaging (fMRI) data, and on matrix completion problems for recommender systems, where we obtain significant speed-ups compared to state-of-the art coordinate descent methods.
  • 12:04 – A Random Matrix Approach to Echo-State Neural Networks Romain Couillet CentraleSupelec, Gilles Wainrib ENS Ulm, Paris, France, Hafiz Tiomoko Ali CentraleSupelec, Gif-sur-Yvette, France, Harry Sevi ENS Lyon, Lyon, ParisPaper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    Recurrent neural networks, especially in their linear version, have provided many qualitative insights on their performance under different configurations. This article provides, through a novel random matrix framework, the quantitative counterpart of these performance results, specifically in the case of echo-state networks. Beyond mere insights, our approach conveys a deeper understanding on the core mechanism under play for both training and testing.

  • Monday – Optimization / Online Learning

    Session chair: Satyen Kale

    Location: Ballroom 3+4
  • 02:00 – Shifting Regret, Mirror Descent, and Matrices Andras Gyorgy , Csaba Szepesvari AlbertaPaper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    We consider the problem of online prediction in changing environments. In this framework the performance of a predictor is evaluated as the loss relative to an arbitrarily changing predictor, whose individual components come from a base class of predictors. Typical results in the literature consider different base classes (experts, linear predictors on the simplex, etc.) separately. Introducing an arbitrary mapping inside the mirror decent algorithm, we provide a framework that unifies and extends existing results. As an example, we prove new shifting regret bounds for matrix prediction problems.
  • 02:17 – Heteroscedastic Sequences: Beyond Gaussianity Oren , Shie Mannor TechnionPaper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    We address the problem of sequential prediction in the heteroscedastic setting, when both the signal and its variance are assumed to depend on explanatory variables. By applying regret minimization techniques, we devise an efficient online learning algorithm for the problem, without assuming that the error terms comply with a specific distribution. We show that our algorithm can be adjusted to provide confidence bounds for its predictions, and provide an application to ARCH models. The theoretic results are corroborated by an empirical study.
  • 02:34 – Convergence of Stochastic Gradient Descent for PCA Ohad Shamir Weizmann Institute of SciencePaper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    We consider the problem of principal component analysis (PCA) in a streaming stochastic setting, where our goal is to find a direction of
    approximate maximal variance, based on a stream of i.i.d. data points in $\reals^d$. A simple and computationally cheap algorithm for this is
    stochastic gradient descent (SGD), which incrementally updates its estimate based on each new data point. However, due to the non-convex nature of the problem, analyzing its performance has been a challenge. In particular, existing guarantees rely on a non-trivial eigengap assumption on the covariance matrix, which is intuitively unnecessary. In this paper, we provide (to the best of our knowledge) the first eigengap-free convergence guarantees for SGD in the context of PCA. This also partially resolves an open problem posed in \cite{hardt2014noisy}. Moreover, under an eigengap assumption, we show that the same techniques lead to new SGD convergence guarantees with better dependence on the eigengap.
  • 03:10 – Fast Stochastic Algorithms for SVD and PCA: Convergence Properties and Convexity Ohad Shamir Weizmann Institute of SciencePaper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    We study the convergence properties of the VR-PCA algorithm introduced by \cite{shamir2015stochastic} for fast computation of leading singular vectors. We prove several new results, including a formal analysis of a block version of the algorithm, and convergence from random initialization. We also make a few observations of independent interest, such as how pre-initializing with just a single exact power iteration can significantly improve the analysis, and what are the convexity and non-convexity properties of the underlying optimization problem.
  • 03:27 – Faster Eigenvector Computation via Shift-and-Invert Preconditioning Dan Garber TTI Chicago, Elad Hazan Princeton University, Chi Jin UC Berkeley, Sham , Cameron Musco Massachusetts Institute of Technology, Praneeth Netrapalli Microsoft Research, Aaron Sidford Microsoft Research, New EnglandPaper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    We give faster algorithms and improved sample complexities for the fundamental problem of estimating the top eigenvector. Given an explicit matrix $A \in \R^{n \times d}$, we show how to compute an $\epsilon$ approximate top eigenvector of $A^TA$ in time $\tilde O( [nnz(A) + \frac{d sr(A)}{gap^2} ] * \log 1/\epsilon )$.
    Here $nnz(A)$ is the number of nonzeros in $A$, $sr(A)$ is the stable rank, and $gap$ is the relative eigengap.

    We also consider an online setting in which, given a stream of i.i.d. samples from a distribution $D$ with covariance matrix $\Sigma$ and a vector $x_0$ which is an $O(gap)$ approximate top eigenvector for $\Sigma$, we show how to refine $x_0$ to an $\epsilon$ approximation using $ O ( \frac{var(D)}{gap * \epsilon} )$ samples from $D$. Here $var(D)$ is a natural notion of variance. Combining our algorithm with previous work to initialize $x_0$, we obtain improved sample complexities and runtimes under a variety of assumptions on $D$.

    We achieve our results via a robust analysis of the classic shift-and-invert preconditioning method. This technique lets us reduce eigenvector computation to *approximately* solving a series of linear systems with fast stochastic gradient methods.

  • 03:44 – Solving Ridge Regression using Sketched Preconditioned SVRG Alon Gonen Hebrew University of Jerusalem, Francesco Orabona Yahoo, Shai Shalev-Shwartz Hebrew University of JerusalemPaper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    We develop a novel preconditioning method for ridge regression, based on recent linear sketching methods. By equipping Stochastic Variance Reduced Gradient (SVRG) with this preconditioning process, we obtain a significant speed-up relative to fast stochastic methods such as SVRG, SDCA and SAG.
  • Monday – Machine Learning Applications

    Session chair: Balazs Kegl

    Location: Marquis
  • 02:00 – Bounded Off-Policy Evaluation with Missing Data for Course Recommendation and Curriculum Design William Hoiles UCLA, Mihaela van der Schaar Paper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    Successfully recommending personalized course schedules is a difficult problem given the diversity of students knowledge, learning behaviour, and goals. This paper presents personalized course recommendation and curriculum design algorithms that exploit logged student data. The algorithms are based on the regression estimator for contextual multi-armed bandits with a penalized variance term. Guarantees on the predictive performance of the algorithms are provided using empirical Bernstein bounds. We also provide guidelines for including expert domain knowledge into the recommendations. Using undergraduate engineering logged data from a post-secondary institution we illustrate the performance of these algorithms.
  • 02:17 – Dealbreaker: A Nonlinear Latent Variable Model for Educational Data Andrew Lan Rice University, Tom Goldstein University of Maryland, Richard Baraniuk Rice University, Christoph Studer Cornell UniversityPaper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    Statistical models of student responses on assessment questions, such as those in homeworks and exams, enable educators and computer-based personalized learning systems to gain insights into students’ knowledge using machine learning. Popular student-response models, including the Rasch model and item response theory models, represent the probability of a student answering a question correctly using an affine function of latent factors. While such models can accurately predict student responses, their ability to interpret the underlying knowledge structure (which is certainly nonlinear) is limited. In response, we develop a new, nonlinear latent variable model that we call the
    dealbreaker model, in which a student’s success probability is determined by their weakest concept mastery. We develop efficient parameter inference algorithms for this model using novel methods for nonconvex optimization. We show that the dealbreaker model achieves comparable or better prediction performance as compared to affine models with real-world educational datasets. We further demonstrate that the parameters learned by the
    dealbreaker model are interpretable—they provide
    key insights into which concepts are critical (i.e., the “dealbreaker”) to answering a question correctly. We conclude by reporting preliminary results for a movie-rating dataset, which illustrate the broader applicability of the dealbreaker model.
  • 02:34 – Estimating Cosmological Parameters from the Dark Matter Distribution Siamak Ravanbakhsh CMU, Junier Oliva CMU, Sebastian Fromenteau Carnegie Mellon Unitversity, Layne Price Carnegie Mellon Unitversity, Shirley Ho Carnegie Mellon Unitversity, Jeff Schneider Carnegie Mellon Unitversity, Barnabas Poczos Paper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    A grand challenge of the 21st century cosmology is to accurately estimate the cosmological parameters of our Universe. A major approach in estimating the cosmological parameters is to use the large scale matter distribution of the Universe. Galaxy surveys provide the means to map out cosmic large-scale structure in three dimensions. Information about galaxy locations is typically summarized in a “single” function of scale, such as the galaxy correlation function or power-spectrum. We show that it is possible to estimate these cosmological parameters directly from the distribution of matter. This paper presents the application of deep 3D convolutional networks to volumetric representation of dark matter simulations as well as the results obtained using a recently proposed distribution regression framework, showing that machine learning techniques are comparable to, and can sometimes outperform, maximum-likelihood point estimates using “cosmological models”. This opens the way to estimating the parameters of our Universe with
    higher accuracy.
  • 03:10 – BASC: Applying Bayesian Optimization to the Search for Global Minima on Potential Energy Surfaces Shane Carr Washington University in St. L, Roman Garnett Wustl, Cynthia Lo Washington University in St. LouisPaper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    We present a novel application of Bayesian optimization to the field of surface science: rapidly and accurately searching for the global minimum on potential energy surfaces. Controlling molecule-surface interactions is key for applications ranging from environmental catalysis to gas sensing. We present pragmatic techniques, including exploration/exploitation scheduling and a custom covariance kernel that encodes the properties of our objective function. Our method, the Bayesian Active Site Calculator (BASC), outperforms differential evolution and constrained minima hopping — two state-of-the-art approaches — in trial examples of carbon monoxide adsorption on a hematite substrate, both with and without a defect.
  • 03:27 – Predictive Entropy Search for Multi-objective Bayesian Optimization Daniel Hernandez-Lobato , Jose miguel Hernandez-Lobato , Amar Shah University of Cambridge, Ryan Adams HarvardPaper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    We present {\small PESMO}, a Bayesian method for identifying the Pareto set of multi-objective optimization problems, when the functions are expensive to evaluate. {\small PESMO} chooses the evaluation points to maximally reduce the entropy of the posterior distribution over the Pareto set. The {\small PESMO} acquisition function is decomposed as a sum of objective-specific acquisition functions, which makes it possible to use the algorithm in \emph{decoupled} scenarios in which the objectives can be evaluated separately and perhaps with different costs. This decoupling capability is useful to identify difficult objectives that require more evaluations. {\small PESMO} also offers gains in efficiency, as its cost scales linearly with the number of objectives, in comparison to the exponential cost of other methods. We compare {\small PESMO} with other methods on synthetic and real-world problems. The results show that {\small PESMO} produces better recommendations with a smaller number of evaluations, and that a decoupled evaluation can lead to improvements in performance, particularly when the number of objectives is large.
  • 03:44 – Pareto Frontier Learning with Expensive Correlated Objectives Amar Shah University of Cambridge, Zoubin Paper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    There has been a surge of research interest in developing tools and analysis for
    Bayesian optimization, the task of finding the global maximizer of an unknown, expensive function through sequential evaluation using Bayesian decision theory.
    However, many interesting problems involve optimizing multiple, expensive to evaluate objectives simultaneously, and relatively little research has addressed this setting from a Bayesian
    theoretic standpoint. A prevailing choice when tackling this problem, is to model
    the multiple objectives as being independent, typically for ease of computation.
    In practice, objectives are correlated to some extent. In this work, we incorporate
    the modelling of inter-task correlations, developing an approximation to overcome
    intractable integrals. We illustrate the power of modelling dependencies between objectives on a range of synthetic and real world multi-objective optimization problems.
  • Monday – Matrix Factorization and Related Topics

    Session chair: Alex Kulesza

    Location: Lyceum
  • 02:00 – Complex Embeddings for Simple Link Prediction Théo Trouillon Xerox, Johannes Welbl , Sebastian Riedel , Eric Gaussier , Guillaume Bouchard Paper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    In statistical relational learning, the link prediction problem is key to automatically understand the structure of large knowledge bases. As in previous studies, we propose to solve this problem through latent factorization. However, here we make use of complex valued embeddings. The composition of complex embeddings can handle a large variety of binary relations, among them symmetric and antisymmetric relations. Compared to state-of-the-art models such as Neural Tensor Network and Holographic Embeddings, our approach based on complex embeddings is arguably simpler, as it only uses the Hermitian dot product, the complex counterpart of the standard dot product between real vectors. Our approach is scalable to large datasets as it remains linear in both space and time, while consistently outperforming alternative approaches on standard link prediction benchmarks.
  • 02:17 – PAC learning of Probabilistic Automaton based on the Method of Moments Hadrien Glaude University of Lille, Olivier Pietquin Univ. Lille, CRIStAL, UMR 9189, SequeL Team, Villeneuve d’Ascq, 59650, FRANCEPaper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    Probabilitic Finite Automata (PFA) are generative graphical models that define distributions with latent variables over finite sequences of symbols, a.k.a. stochastic languages. Traditionally, unsupervised learning of PFA is performed through algorithms that iteratively improves the likelihood like the Expectation-Maximization (EM) algorithm. Recently, learning algorithms based on the so-called Method of Moments (MoM) have been proposed as a much faster alternative that comes with PAC-style guarantees. However, these algorithms do not ensure the learnt automata to model a proper distribution, limiting their applicability and preventing them to serve as an initialization to iterative algorithms. In this paper, we propose a new MoM-based algorithm with PAC-style guarantees that learns automata defining proper distributions. We assess its performances on synthetic problems from the PAutomaC challenge and real datasets extracted from Wikipedia against previous MoM-based algorithms and EM algorithm.
  • 02:34 – Rich Component Analysis Rong Ge , James Zou Paper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    In many settings, we have multiple data sets (also called views) that capture different and overlapping aspects of the same phenomenon. We are often interested in finding patterns that are unique to one or to a subset of the views. For example, we might have one set of molecular observations and one set of physiological observations on the same group of individuals, and we want to quantify molecular patterns that are uncorrelated with physiology. Despite being a common problem, this is highly challenging when the correlations come from complex distributions. In this paper, we develop the general framework of Rich Component Analysis (RCA) to model settings where the observations from different views are driven by different sets of latent components, and each component can be a complex, high-dimensional distribution. We introduce algorithms based on cumulant extraction that provably learn each of the components without having to model the other components. We show how to integrate RCA with stochastic gradient descent into a meta-algorithm for learning general models, and demonstrate substantial improvement in accuracy on several synthetic and real datasets in both supervised and unsupervised tasks. Our method makes it possible to learn latent variable models when we don’t have samples from the true model but only samples after complex perturbations.
  • 03:10 – Beyond CCA: Moment Matching for Multi-View Models Anastasia Podosinnikova INRIA – ENS, Francis Bach Inria, Simon Lacoste-Julien INRIAPaper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    We introduce three novel semi-parametric extensions of probabilistic canonical correlation analysis with identifiability guarantees. We consider moment matching techniques for estimation in these models. For that, by drawing explicit links between the new models and a discrete version of independent component analysis (DICA), we first extend the DICA cumulant tensors to the new discrete version of CCA. By further using a close connection with independent component analysis, we introduce generalized covariance matrices, which can replace the cumulant tensors in the moment matching framework, and, therefore, improve sample complexity and simplify derivations and algorithms significantly. As the tensor power method or orthogonal joint diagonalization are not applicable in the new setting, we use non-orthogonal joint diagonalization techniques for matching the cumulants. We demonstrate performance of the proposed models and estimation techniques on experiments with both synthetic and real datasets.
  • 03:27 – Isotonic Hawkes Processes Yichen Wang Georgia Tech, Bo Xie , Nan Du , Le Song GatechPaper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    Hawkes processes are powerful tools for modeling the mutual-excitation phenomena commonly observed in event data from a variety of domains, such as social networks, quantitative finance and healthcare records. The intensity function of a Hawkes process is typically assumed to be linear in the sum of triggering kernels, rendering it inadequate to capture nonlinear effects present in real-world data. To address this shortcoming, we propose an Isotonic-Hawkes process whose intensity function is modulated by an additional nonlinear link function. We also developed a novel iterative algorithm which learns both the nonlinear link function and other parameters provably. We showed that Isotonic-Hawkes processes can fit a variety of nonlinear patterns which cannot be captured by conventional Hawkes processes, and achieve superior empirical performance in real world applications.
  • 03:44 – Non-negative Matrix Factorization under Heavy Noise Chiranjib Bhattacharya , Navin Goyal Microsoft Research India, Ravindran Kannan Microsoft Reseach India, Jagdeep Pani Indian Institute of SciencePaper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    The Noisy Non-negative Matrix factorization (NMF) is: given a data matrix A (d x n), find non-negative matrices B;C (d x k, k x n respy.) so that A = BC +N, where N is a noise matrix.
    Existing polynomial time algorithms with proven error guarantees require EACH column N_.j to have l1 norm much smaller than ||(BC)_.j ||_1, which could be very restrictive. In important applications of NMF such as Topic Modeling as well as theoretical noise models (e.g. Gaussian with high sigma), almost EVERY column of N_.j violates this condition. We introduce the heavy noise model which only requires the average noise over large subsets of columns to be small. We initiate
    a study of Noisy NMF under the heavy noise model. We show that our noise model subsumes noise models of theoretical and practical interest (for e.g. Gaussian noise of maximum possible sigma). We then devise an algorithm TSVDNMF which
    under certain assumptions on B,C, solves the problem under heavy noise. Our error guarantees match those of previous algorithms. Our running time of O(k.(d+n)^2) is substantially better than the O(d.n^3) for the previous best. Our assumption on B is weaker than the “Separability” assumption made by all previous results. We provide empirical justification for our assumptions on C. We also provide the first proof of identifiability (uniqueness of B) for noisy NMF which is not based on separability and does not use hard to check geometric conditions. Our algorithm outperforms earlier polynomial time algorithms both in time and error, particularly in the presence
    of high noise.
  • Monday – Bandit Problems

    Session chair: Shie Mannor

    Location: Empire
  • 02:00 – An optimal algorithm for the Thresholding Bandit Problem Andrea LOCATELLI University of Potsdam, Maurilio Gutzeit Universität Potsdam, Alexandra Carpentier Paper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    We study a specific combinatorial pure exploration stochastic bandit problem where the learner aims at finding the set of arms whose means are above a given threshold, up to a given precision, and for a fixed time horizon. We propose a parameter-free algorithm based on an original heuristic, and prove that it is optimal for this problem by deriving matching upper and lower bounds. To the best of our knowledge, this is the first non-trivial pure exploration setting with fixed budget for which provably optimal strategies are constructed.
  • 02:17 – Anytime Exploration for Multi-armed Bandits using Confidence Information Kwang-Sung Jun UW-Madison, Robert Nowak Paper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    We introduce anytime Explore-$m$, a pure exploration problem for multi-armed bandits (MAB) that requires making a prediction of the top-$m$ arms at every time step. Anytime Explore-$m$ is more practical than fixed budget or fixed confidence formulations of the top-$m$ problem, since many applications involve a finite, but unpredictable, budget. However, the development and analysis of anytime algorithms present many challenges. We propose AT-LUCB (AnyTime Lower and Upper Confidence Bound), the first nontrivial algorithm that provably solves anytime Explore-$m$. Our analysis shows that the sample complexity of AT-LUCB is competitive to anytime variants of existing algorithms. Moreover, our empirical evaluation on AT-LUCB shows that AT-LUCB performs as well as or better than state-of-the-art baseline methods for anytime Explore-$m$.
  • 02:34 – Anytime optimal algorithms in stochastic multi-armed bandits Rémy Degenne Université Paris Diderot, Vianney Perchet Paper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    We introduce an anytime algorithm for stochastic multi-armed bandit with optimal distribution free and distribution dependent bounds (for a specific family of parameters). The performances of this algorithm (as well as another one motivated by the conjectured optimal bound) are evaluated empirically. A similar analysis is provided with full information, to serve as a benchmark.
  • 03:10 – PAC Lower Bounds and Efficient Algorithms for The Max $K$-Armed Bandit Problem Yahel David Technion, Nahum Shimkin TechnionPaper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    We consider the Max $K$-Armed Bandit problem, where a learning agent is faced with several stochastic arms, each a source of i.i.d. rewards of unknown distribution.
    At each time step the agent chooses an arm, and observes the reward of the obtained sample.
    Each sample is considered here as a separate item with the reward designating its value, and the goal is to find an item with the highest possible value. Our basic assumption is a known lower bound on the {\em tail function} of the reward distributions. Under the PAC framework, we provide a lower bound on the sample complexity of any
    $(\epsilon,\delta)$-correct algorithm, and propose an algorithm that attains this bound
    up to logarithmic factors.
    We provide an analysis of the robustness of the proposed algorithm to the model assumptions, and further compare its performance to the simple non-adaptive variant, in which the arms are chosen randomly at each stage.
  • 03:27 – Conservative Bandits Yifan Wu , Roshan Shariff University of Alberta, Tor , Csaba Szepesvari AlbertaPaper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    We study a novel multi-armed bandit problem that models the challenge faced by a company wishing to explore new strategies to maximize revenue whilst simultaneously maintaining their revenue above a fixed baseline, uniformly over time. While previous work addressed the problem under the weaker requirement of maintaining the revenue constraint only at a given fixed time in the future, the design of those algorithms makes them unsuitable under the more stringent constraints. We consider both the stochastic and the adversarial settings, where we propose natural yet novel strategies and analyze the price for maintaining the constraints. Amongst other things, we prove both high probability and expectation bounds on the regret, while we also consider both the problem of maintaining the constraints with high probability or expectation. For the adversarial setting the price of maintaining the constraint appears to be higher, at least for the algorithm considered. A lower bound is given showing that the algorithm for the stochastic setting is almost optimal. Empirical results obtained in synthetic environments complement our theoretical findings.
  • 03:44 – No-Regret Algorithms for Heavy-Tailed Linear Bandits Andres Munoz Medina , Scott Yang Paper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    We analyze the problem of linear bandits under heavy tailed
    noise. Most of of the work on linear bandits has been based on the
    assumption of bounded or sub-Gaussian noise. However, this assumption
    is often violated in common scenarios such as financial markets. We
    present two algorithms to tackle this problem: one based on dynamic truncation
    and one based on a median of means estimator. We show that,
    when the noise admits admits only a $1 + \eps$ moment, these
    algorithms are still able to achieve regret in $\wt O(T^{\frac{2 + \eps}{2(1 + \eps)}})$
    and $\wt O(T^{\frac{1+ 2\eps}{1 + 3 \eps}})$ respectively. In particular,
    they guarantee sublinear regret as long as the noise has finite variance.
    We also present empirical results
    showing that our algorithms achieve a better performance than the
    current state of the art for bounded noise when the $L_\infty$ bound
    on the noise is large yet the $1 + \eps$ moment of the noise is small.
  • Monday – Graphical Models

    Session chair: Stefano Ermon

    Location: Soho
  • 02:00 – Hierarchical Span-Based Conditional Random Fields for Labeling and Segmenting Events in Wearable Sensor Data Streams Roy Adams Univ. of Massachusetts-Amherst, Nazir Saleheen , Edison Thomaz , Abhinav Parate , Santosh Kumar , Benjamin Marlin Paper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    The field of mobile health (mHealth) has the potential to yield new insights into health and behavior through the analysis of continuously recorded data from wearable health and activity sensors. In this paper, we present a hierarchical span-based conditional random field model for the key problem of jointly detecting discrete events in such sensor data streams and segmenting these events into high-level activity sessions. Our model includes higher-order cardinality factors and inter-event duration factors to capture domain-specific structure in the label space. We show that our model supports exact MAP inference in quadratic time via dynamic programming, which we leverage to perform learning in the structured support vector machine framework. We apply the model to the problems of smoking and eating detection using four real data sets. Our results show statistically significant improvements in segmentation performance relative to a hierarchical pairwise CRF.
  • 02:17 – Efficient Multi-Instance Learning for Activity Recognition from Time Series Data Using an Auto-Regressive Hidden Markov Model Xinze Guan Oregon State University, Raviv Raich Oregon State University, Weng-keen Paper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    Activity recognition from sensor data has spurred a great deal of interest due to its impact on health care. Prior work on activity recognition from multivariate time series data has mainly applied supervised learning techniques which require a high degree of annotation effort to produce training data with the start and end times of each activity. In order to reduce the annotation effort, we present a weakly supervised approach based on multi-instance learning. We introduce a generative graphical model for multi-instance learning on time series data based on an auto-regressive hidden Markov model. Our model has a number of advantages, including the ability to produce both bag and instance-level predictions as well as an efficient exact inference algorithm based on dynamic programming.
  • 02:34 – Clustering High Dimensional Categorical Data via Topographical Features Chao Chen CUNY, Novi Quadrianto University of SussexPaper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    Analysis of categorical data is a challenging task. In this paper, we propose to compute topographical features of high-dimensional categorical data. We propose an efficient algorithm to extract modes of the underlying distribution and their attractive basins. These topographical features provide a geometric view of the data and can be applied to visualization and clustering of real world challenging datasets. Experiments show that our principled method outperforms state-of-the-art clustering methods while also admits an embarrassingly parallel property.
  • 03:10 – Nonlinear Statistical Learning with Truncated Gaussian Graphical Models Qinliang Su Duke University, xuejun Liao , changyou Chen , Lawrence Carin Paper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    We introduce the truncated Gaussian graphical model (TGGM) as a novel framework for designing statistical models for nonlinear learning. A TGGM is a Gaussian graphical model (GGM) with a subset of variables truncated to be nonnegative. The truncated variables are assumed latent and integrated out to induce a marginal model. We show that the variables in the marginal model are non-Gaussian distributed and their expected relations are nonlinear. We use expectation-maximization to break the inference of the nonlinear model into a sequence of TGGM inference problems, each of which is efficiently solved by using the properties and numerical methods of multivariate Gaussian distributions. We use the TGGM to design models for nonlinear regression and classification, with the performances of these models demonstrated on extensive benchmark datasets and compared to state-of-the-art competing results.
  • 03:27 – Collapsed Variational Inference for Sum-Product Networks Han Zhao Carnegie Mellon University, Tameem Adel University of Amsterdam, Geoff Gordon CMU, Brandon Amos Carnegie Mellon UniversityPaper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    Sum-Product Networks (SPNs) are probabilistic inference machines that admit exact inference in linear time in the size of the network. Existing parameter learning approaches for SPNs are largely based on the maximum likelihood principle and are subject to overfitting compared to more Bayesian approaches. Exact Bayesian posterior inference for SPNs is computationally intractable. Even approximation techniques such as standard variational inference and posterior sampling for SPNs are computationally infeasible even for networks of moderate size due to the large number of local latent variables per instance. In this work, we propose a novel deterministic collapsed variational inference algorithm for SPNs that is computationally efficient, easy to implement and at the same time allows us to incorporate prior information into the optimization formulation. Extensive experiments show a significant improvement in accuracy compared with a maximum likelihood based approach.
  • 03:44 – Square Root Graphical Models: Multivariate Generalizations of Univariate Exponential Families that Permit Positive Dependencies David Inouye University of Texas at Austin, Pradeep Ravikumar UT Austin, Inderjit Paper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    We develop Square Root Graphical Models (SQR), a novel class of parametric graphical models that provides multivariate generalizations of univariate exponential family distributions. Previous multivariate graphical models [Yang et al. 2015] did not allow positive dependencies for the exponential and Poisson generalizations. However, in many real-world datasets, variables clearly have positive dependencies. For example, the airport delay time in New York—modeled as an exponential distribution—is positively related to the delay time in Boston. With this motivation, we give an example of our model class derived from the univariate exponential distribution that allows for almost arbitrary positive and negative dependencies with only a mild condition on the parameter matrix—a condition akin to the positive definiteness of the Gaussian covariance matrix. Our Poisson generalization allows for both positive and negative dependencies without any constraints on the parameter values. We also develop parameter estimation methods using node-wise regressions with $\ell_1$ regularization and likelihood approximation methods using sampling. Finally, we demonstrate our exponential generalization on a synthetic dataset and a real-world dataset of airport delay times.
  • Monday – Transfer Learning / Learning Theory

    Session chair: Alina Beygelzimer

    Location: Liberty
  • 02:00 – A New PAC-Bayesian Perspective on Domain Adaptation Pascal Germain INRIA, Amaury Habrard , François Laviolette GRAAL, Université Laval, Emilie Morvant Paper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    We study the issue of PAC-Bayesian domain adaptation: We want to learn, from a source domain, a majority vote model dedicated to a target one. Our theoretical contribution brings a new perspective by deriving an upper-bound on the target risk where the distributions’ divergence – expressed as a ratio – controls the trade-off between a source error measure and the target voters’ disagreement. Our bound suggests that one has to focus on regions where the source data is informative. From this result, we derive a PAC-Bayesian generalization bound, and specialize it to linear classifiers. Then, we infer a learning algorithm and perform experiments on real data.
  • 02:17 – Domain Adaptation with Conditional Transferable Components Mingming Gong University of Technology Sydne, Kun Zhang Carnegie Mellon University, Tongliang Liu MPI Tuebingen, Dacheng Tao , Clark Glymour , Bernhard Schölkopf Paper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    Domain adaptation arises in supervised learning when the training (source domain) and test (target domain) data have different distributions. Let $X$ and $Y$ denote the features and target, respectively, previous work on domain adaptation considers the covariate shift situation where the distribution of the features $P(X)$ changes across domains while the conditional distribution $P(Y|X)$ stays the same. To reduce domain discrepancy, recent methods try to find invariant components $\mathcal{T}(X)$ that have similar $P(\mathcal{T}(X))$ by explicitly minimizing a distribution discrepancy measure. However, it is not clear if $P(Y|\mathcal{T}(X))$ in different domains is also similar when $P(Y|X)$ changes. Furthermore, transferable components do not necessarily have to be invariant. If the change in some components is identifiable, we can make use of such components for prediction in the target domain. In this paper, we focus on the case where $P(X|Y)$ and $P(Y)$ both change in a causal system in which $Y$ is the cause for $X$. Under appropriate assumptions, we aim to extract conditional transferable components whose conditional distribution $P(\mathcal{T}(X)|Y)$ is invariant after proper location-scale (LS) transformations, and identify how $P(Y)$ changes between domains simultaneously. We provide theoretical analysis and empirical evaluation on both synthetic and real-world data to show the effectiveness of our method.
  • 02:34 – Minimizing the Maximal Loss: How and Why Shai Shalev-Shwartz Hebrew University of Jerusalem, Yonatan Wexler OrcamPaper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    A commonly used learning rule is to approximately minimize the \emph{average} loss over the training set. Other learning algorithms, such as AdaBoost and hard-SVM, aim at minimizing the \emph{maximal} loss over the training set. The average loss is more popular, particularly in deep learning, due to three main reasons. First, it can be conveniently minimized using online algorithms, that process few examples at each iteration. Second, it is often argued that there is no sense to minimize the loss on the training set too much, as it will not be reflected in the generalization loss. Last, the maximal loss is not robust to outliers. In this paper we describe and analyze an algorithm that can convert any online algorithm to a minimizer of the maximal loss. We show, theoretically and empirically, that in some situations better accuracy on the training set is crucial to obtain good performance on unseen examples. Last, we propose robust versions of the approach that can handle outliers.
  • 03:10 – Accurate Robust and Efficient Error Estimation for Decision Trees Lixin Fan Nokia TechnologiesPaper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    This paper illustrates a novel approach to the estimation of generalization error of decision tree classifiers. We set out the study of decision tree errors in the context of consistency analysis theory, which proved that the Bayes error can be achieved only if when the number of data samples thrown into each leaf node goes to infinity. For the more challenging and practical case where the sample size is finite or small, a novel sampling error term is introduced in this paper to cope with the small sample problem effectively and efficiently. Extensive experimental results show that the proposed error estimate is superior to the well known K-fold cross validation methods in terms of robustness and accuracy. Moreover it is orders of magnitudes more efficient than cross validation methods.
  • 03:27 – The Teaching Dimension of Linear Learners Ji Liu University of Rochester, Xiaojin Zhu University of Wisconsin, Hrag Ohannessian University of Wisconsin-MadisonPaper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    Teaching dimension is a learning theoretic quantity that specifies the minimum training set size to teach a target model to a learner. Previous studies on teaching dimension focused on version-space learners which maintain all hypotheses consistent with the training data, and cannot be applied to modern machine learners which select a specific hypothesis via optimization. This paper presents the first known teaching dimension for ridge regression, support vector machines, and logistic regression. We also exhibit optimal training sets that match these teaching dimensions. Our approach generalizes to other linear learners.
  • 03:44 – Loss factorization, weakly supervised learning and label noise robustness Giorgio Patrini ANU / Data61, Frank Nielsen Ecole Polytechnique and Sony CS Labs Inc., Richard Nock Nicta & ANU, Marcello Carioni Max Planck InstitutePaper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    We prove that
    the empirical risk of most well-known loss functions factors into a linear term aggregating all labels with a term that is label free, and can further be expressed by sums of the same loss. This holds true even for non-smooth, non-convex losses and in any
    RKHS. The first term is a (kernel) mean operator — the focal quantity of this work — which we characterize as the sufficient statistic for the labels. The result tightens known generalization bounds and sheds new light on their interpretation.

    Factorization has a direct application on weakly supervised learning. In particular, we demonstrate that algorithms like SGD and proximal methods can be adapted with minimal effort to handle weak supervision, once the mean operator has been estimated. We apply this idea to learning with asymmetric noisy labels, connecting and extending prior work. Furthermore, we show that most losses enjoy a data-dependent (by the mean operator) form of noise robustness, in contrast with known negative results.

  • Monday – Neural Networks and Deep Learning I

    Session chair: Kyunghyun Cho

    Location: Ballroom 1+2+Juliard
  • 04:15 – Texture Networks: Feed-forward Synthesis of Textures and Stylized Images Dmitry Ulyanov Skolkovo institute of science , Vadim Lebedev , Andrea , Victor Lempitsky Skolkovo Institute of Sci&TechPaper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    Gatys et al. recently demonstrated that deep networks can generate beautiful textures and stylized images from a single texture example. However, their methods requires a slow and memory-consuming optimization process. We propose here an alternative approach that moves the computational burden to a learning stage. Given a single example of a texture, our approach trains compact feed-forward convolutional networks to generate multiple samples of the same texture of arbitrary size and to transfer artistic style from a given image to any other image. The resulting networks are remarkably light-weight and can generate textures of quality comparable to Gatys et al., but hundreds of times faster. More generally, our approach highlights the power and flexibility of generative feed-forward models trained with complex and expressive loss functions.
  • 04:32 – Discrete Deep Feature Extraction: A Theory and New Architectures Thomas Wiatowski ETH Zurich, Michael Tschannen ETH Zurich, Aleksandar Stanic ETH Zurich, Philipp Grohs University of Vienna, Helmut Boelcskei ETH ZurichPaper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    First steps towards a mathematical theory of deep convolutional neural networks for feature extraction were made—for the continuous-time case—in Mallat, 2012, and Wiatowski and Bölcskei, 2015. This paper considers the discrete case, introduces new convolutional neural network architectures, and proposes a mathematical framework for their analysis. Specifically, we establish deformation and translation sensitivity results of local and global nature, and we investigate how certain structural properties of the input signal are reflected in the corresponding feature vectors. Our theory applies to general filters and general Lipschitz-continuous non-linearities and pooling operators. Experiments on handwritten digit classification and facial landmark detection—including feature importance evaluation—complement the theoretical findings.
  • 04:49 – Deep Structured Energy Based Models for Anomaly Detection Shuangfei Zhai Binghamton University, Yu Cheng IBM Research, Weining Lu Tsinghua Univerisity, Zhongfei Zhang Binghamton UniversityPaper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    In this paper, we attack the anomaly detection problem by directly modeling the data distribution with deep architectures. We hence propose deep structured energy based models (DSEBMs), where the energy function is the output of a deterministic deep neural network with structure. We develop novel model architectures to integrate EBMs with different types of data such as static data, sequential data, and spatial data, and apply appropriate model architectures to adapt to the data structure. Our training algorithm is built upon the recent development of score matching (Hyvarinen, 2005), which connects an EBM with a regularized autoencoder, eliminating the need for complicated sampling method. Statistically sound decision criterion can be derived for anomaly detection purpose from the perspective of the energy landscape of the data distribution. We investigate two decision criteria for performing anomaly detection: the energy score and the reconstruction error. Extensive empirical studies on benchmark anomaly detection tasks demonstrate that our proposed model consistently matches or outperforms all the competing methods.
  • 05:25 – Noisy Activation Functions Caglar Gülçehre , Marcin Moczulski , Misha Denil , Yoshua Bengio U. of MontrealPaper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    Common nonlinear activation functions used in neural networks can cause training difficulties due to the saturation behavior of the activation function, which may hide dependencies that are not visible to vanilla-SGD (using first order gradients only). Gating mechanisms that use softly saturating activation functions to emulate the discrete switching of digital logic circuits are good examples of this. We propose to exploit the injection of appropriate noise so that the gradients may flow easily, even if the noiseless application of the activation function would yield zero gradients. Large noise will dominate the noise-free gradient and allow stochastic gradient descent to explore more. By adding noise only to the problematic parts of the activation
    function, we allow the optimization procedure to explore the boundary between the degenerate saturating) and the well-behaved parts of the activation function. We also establish connections to simulated annealing, when the amount of noise is annealed down, making it easier to optimize hard objective functions. We find experimentally that replacing such saturating activation functions by noisy variants helps optimization in many contexts, yielding state-of-the-art or competitive results on different datasets and task, especially when training seems to be the most difficult, e.g., when curriculum learning is necessary to obtain good results.
  • 05:42 – A Kronecker-factored approximate Fisher matrix for convolution layers Roger Grosse , James Martens University of TorontoPaper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    Second-order optimization methods such as natural gradient descent have the potential to speed up training of neural networks by correcting for the curvature of the loss function. Unfortunately, the exact natural gradient is impractical to compute for large models, and most approximations either require an expensive iterative procedure or make crude approximations to the curvature. We present Kronecker Factors for Convolution (KFC), a tractable approximation to the Fisher matrix for convolutional networks based on a structured probabilistic model for the distribution over backpropagated derivatives. Similarly to the recently proposed Kronecker-Factored Approximate Curvature (K-FAC), each block of the approximate Fisher matrix decomposes as the Kronecker product of small matrices, allowing for efficient inversion. KFC captures important curvature information while still yielding comparably efficient updates to stochastic gradient descent (SGD). We show that the updates are invariant to commonly used reparameterizations, such as centering of the activations. In our experiments, approximate natural gradient descent with KFC was able to train convolutional networks several times faster than carefully tuned SGD. Furthermore, it was able to train the networks in 10-20 times fewer iterations than SGD, suggesting its potential applicability in a distributed setting.
  • 05:59 – Recurrent Orthogonal Networks and Long-Memory Tasks Mikael Henaff NYU, Facebook, Arthur , Yann Paper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    Although RNNs have been shown to be power-
    ful tools for processing sequential data, finding
    architectures or optimization strategies that al-
    low them to model very long term dependencies
    is still an active area of research. In this work,
    we carefully analyze two synthetic datasets orig-
    inally outlined in (Hochreiter & Schmidhuber,
    1997) which are used to evaluate the ability of
    RNNs to store information over many time steps.
    We explicitly construct RNN solutions to these
    problems, and using these constructions, illumi-
    nate both the problems themselves and the way in
    which RNNs store different types of information
    in their hidden states. These constructions fur-
    thermore explain the success of recent methods
    that specify unitary initializations or constraints
    on the transition matrices.
  • Monday – Neural Networks and Deep Learning II (Computer Vision)

    Session chair: Laurens van der Maaten

    Location: Ballroom 3+4
  • 04:15 – Group Equivariant Convolutional Networks Taco Cohen University of Amsterdam, Max Welling University of Amsterdam / CIFARPaper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    We introduce Group equivariant Convolutional Neural Networks (G-CNNs), a natural generalization of convolutional neural networks that reduces sample complexity by exploiting symmetries. G-CNNs use G-convolutions, a new type of layer that enjoys a substantially higher degree of weight sharing than regular convolution layers. G-convolutions increase the expressive capacity of the network without increasing the number of parameters. Group convolution layers are easy to use and can be implemented with negligible computational overhead for discrete groups generated by translations, reflections and rotations. G-CNNs achieve state of the art results on CIFAR10 and rotated MNIST.
  • 04:32 – Learning End-to-end Video Classification with Rank-Pooling Basura Fernando ANU Canberra Australia, Stephen Gould Australian National UniversityPaper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    We introduce a new model for representation learning and classification of video sequences. Our model is based on a convolutional neural network coupled with a novel temporal pooling layer. The temporal pooling layer relies on an inner-optimization problem to efficiently encode temporal semantics over arbitrarily long video clips into a fixed-length vector representation. Importantly, the representation and classification parameters of our model can be estimated jointly in an end-to-end manner by formulating learning as a bilevel optimization problem. Furthermore, the model can make use of any existing convolutional neural network architecture (e.g., AlexNet or VGG) without modification or introduction of additional parameters. We demonstrate our approach on action and activity recognition tasks.
  • 04:49 – Learning Physical Intuition of Block Towers by Example Adam Lerer Facebook AI Research, Sam Gross Facebook AI Research, Rob Fergus Facebook AI ResearchPaper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    Wooden blocks are a common toy for infants, allowing them to develop motor skills and gain intuition about the physical behavior of the world. In this paper, we explore the ability of deep feed-forward models to learn such intuitive physics. Using a 3D game engine, we create small towers of wooden blocks whose stability is randomized and render them collapsing (or remaining upright). This data allows us to train large convolutional network models which can accurately predict the outcome, as well as estimating the trajectories of the blocks. The models are also able to generalize in two important ways: (i) to new physical scenarios, e.g. towers with an additional block and (ii) to images of real wooden blocks, where it obtains a performance comparable to human subjects.
  • 05:25 – Large-Margin Softmax Loss for Convolutional Neural Networks Weiyang Liu Peking University, Yandong Wen South China University of Technology, Zhiding Yu Carnegie Mellon University, Meng Yang Shenzhen UniversityPaper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    Cross-entropy loss together with softmax is arguably one of the most common used supervision components in convolutional neural networks (CNNs). Despite its simplicity, popularity and excellent performance, the component does not explicitly encourage discriminative learning of features. In this paper, we propose a generalized large-margin softmax (L-Softmax) loss which explicitly encourages intra-class compactness and inter-class separability between learned features. Moreover, L-Softmax not only can adjust the desired margin but also can avoid overfitting. We also show that the L-Softmax loss can be optimized by typical stochastic gradient descent. Extensive experiments on four benchmark datasets demonstrate that the deeply-learned features with L-softmax loss become more discriminative, hence significantly boosting the performance on a variety of visual classification and verification tasks.
  • 05:42 – Network Morphism Tao Wei University at Buffalo, Changhu Wang Microsoft Research, Yong Rui Microsoft Research, Chang Wen Chen Paper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    We present a systematic study on how to morph a well-trained neural network to a new one so that its network function can be completely preserved. We define this as network morphism in this research. After morphing a parent network, the child network is expected to inherit the knowledge from its parent network and also has the potential to continue growing into a more powerful one with much shortened training time. The first requirement for this network morphism is its ability to handle diverse morphing types of networks, including changes of depth, width, kernel size, and even subnet. To meet this requirement, we first introduce the network morphism equations, and then develop novel morphing algorithms for all these morphing types for both classic and convolutional neural networks. The second requirement is its ability to deal with non-linearity in a network. We propose a family of parametric-activation functions to facilitate the morphing of any continuous non-linear activation neurons. Experimental results on benchmark datasets and typical neural networks demonstrate the effectiveness of the proposed network morphism scheme.
  • 05:59 – Multi-Bias Non-linear Activation in Deep Neural Networks Hongyang Li The Chinese Univ. of HK, Wanli Ouyang , Xiaogang Wang Paper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    As a widely used non-linear activation, Rectified Linear Unit (ReLU) separates noise and signal in a feature map by learning a threshold or bias. However, we argue that the classification of noise and signal not only depends on the magnitude of responses, but also the context of how the feature responses would be used to detect more abstract patterns in higher layers. In order to output multiple response maps with magnitude in different ranges for a particular visual pattern, existing networks employing ReLU and its variants have to learn a large number of redundant filters. In this paper, we propose a multi-bias non-linear activation (MBA) layer to explore the information hidden in the magnitudes of responses. It is placed after the convolution layer to decouple the responses to a convolution kernel into multiple maps by multi-thresholding magnitudes, thus generating more patterns in the feature space at a low computational cost. It provides great flexibility of selecting responses to different visual patterns in different magnitude ranges to form rich representations in higher layers. Such a simple and yet effective scheme achieves the state-of-the-art performance on several benchmarks.
  • Monday – Approximate Inference

    Session chair: Jun Zhu

    Location: Marquis
  • 04:15 – Boolean Matrix Factorization and Noisy Completion via Message Passing Siamak Ravanbakhsh CMU, Barnabas Poczos , Russell Greiner University of AlbertaPaper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    Boolean matrix factorization and Boolean matrix completion from noisy observations are desirable unsupervised data-analysis methods due to their interpretability, but hard to perform due to their NP-hardness. We treat these problems as maximum a posteriori inference problems in a graphical model and present a message passing approach that scales linearly with the number of observations and factors. Our empirical study demonstrates that message passing is able to recover low-rank Boolean matrices, in the boundaries of theoretically possible recovery and compares favorably with state-of-the-art in real-world applications, such collaborative filtering with large-scale Boolean data.
  • 04:32 – Stochastic Discrete Clenshaw-Curtis Quadrature Nico Piatkowski TU Dortmund, Katharina Morik TU DortmundPaper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    The partition function is fundamental for probabilistic graphical models—it is required for inference, parameter estimation, and model selection. Evaluating this function corresponds to discrete integration, namely a weighted sum over an exponentially large set. This task quickly becomes intractable as the dimensionality of the problem increases. We propose an approximation scheme that, for any discrete graphical model whose parameter vector has bounded norm, estimates the partition function with arbitrarily small error. Our algorithm relies on a near minimax optimal polynomial approximation to the potential function and a Clenshaw-Curtis style quadrature. Furthermore, we show that this algorithm can be randomized to split the computation into a high-complexity part and a low-complexity part, where the latter may be carried out on small computational devices. Experiments confirm that the new randomized algorithm is highly accurate if the parameter norm is small, and is otherwise comparable to methods with unbounded error.
  • 04:49 – Beyond Parity Constraints: Fourier Analysis of Hash Functions for Inference Tudor Achim Stanford University, Ashish Sabharwal Allen Institute for AI, Stefano Ermon Paper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    Random projections have played an important role in scaling up machine learning and data mining algorithms. Recently they have also been applied to probabilistic inference to estimate properties of high-dimensional distributions; however, they all rely on the same class of projections based on universal hashing. We provide a general framework to analyze random projections which relates their statistical properties to their Fourier spectrum, which is a well-studied area of theoretical computer science. Using this framework we introduce two new classes of hash functions for probabilistic inference and model counting that show promising performance on synthetic and real-world benchmarks.
  • 05:25 – Variable Elimination in the Fourier Domain Yexiang Xue Cornell University, Stefano Ermon , Ronan Le Bras Cornell University, Carla , Bart Paper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    The ability to represent complex high dimensional
    probability distributions in a compact form is one
    of the key insights in the field of graphical models.
    Factored representations are ubiquitous in machine learning
    and lead to major computational advantages.
    We explore a different type of compact representation
    based on discrete Fourier representations, complementing
    the classical approach based on conditional independencies.
    We show that a large class of probabilistic graphical models
    have a compact Fourier representation. This theoretical
    result opens up an entirely new way of approximating a
    probability distribution. We demonstrate the significance
    of this approach by applying it to the variable elimination
    algorithm. Compared with the traditional bucket
    representation and other approximate inference algorithms,
    we obtain significant improvements.
  • 05:42 – Learning and Inference via Maximum Inner Product Search Stephen Mussmann Stanford University, Stefano Ermon Paper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    A large class of commonly used probabilistic models known as log-linear models are defined up to a normalization constant.Typical learning algorithms for such models require solving a sequence of probabilistic inference queries.
    These inferences are typically intractable, and are a major bottleneck for learning models with large output spaces. In this paper, we provide a new approach for amortizing the cost of a sequence of related inference queries, such as the ones arising during learning. Our technique relies on a surprising connection with algorithms developed in the past two decades for similarity search in large data bases. Our approach achieves improved running times with provable approximation guarantees. We show that it performs well both on synthetic data and neural language models with large output spaces.
  • 05:59 – Analysis of Variational Bayesian Factorizations for Sparse and Low-Rank Estimation David Wipf Microsoft Research, BeijingPaper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    Variational Bayesian (VB) approximations anchor a wide variety of probabilistic models, where tractable posterior inference is almost never possible. Typically based on the so-called VB mean-field approximation to the Kullback-Leibler divergence, a posterior distribution is sought that factorizes across groups of latent variables such that, with the distributions of all but one group of variables held fixed, an optimal closed-form distribution can be obtained for the remaining group, with differing algorithms distinguished by how different variables are grouped and ultimately factored. This basic strategy is particularly attractive when estimating structured low-dimensional models of high-dimensional data, exemplified by the search for minimal rank and/or sparse approximations to observed data. To this end, VB models are frequently deployed across applications including multi-task learning, robust PCA, subspace clustering, matrix completion, affine rank minimization, source localization, compressive sensing, and assorted combinations thereof. Perhaps surprisingly however, there exists almost no attendant theoretical explanation for how various VB factorizations operate, and in which situations one may be preferable to another. We address this relative void by comparing arguably two of the most popular factorizations, one built upon Gaussian scale mixture priors, the other bilinear Gaussian priors, both of which can favor minimal rank or sparsity depending on the context. More specifically, by reexpressing the respective VB objective functions, we weigh multiple factors related to local minima avoidance, feature transformation invariance and correlation, and computational complexity to arrive at insightful conclusions useful in explaining performance and deciding which VB flavor is advantageous. We also envision that the principles explored here are quite relevant to other structured inverse problems where VB serves as a viable solution.
  • Monday – Metric and Manifold Learning / Kernel Methods

    Session chair: Le Song

    Location: Lyceum
  • 04:15 – Fast k-Nearest Neighbour Search via Dynamic Continuous Indexing Ke Li UC Berkeley, Jitendra Malik Paper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    Existing methods for retrieving k-nearest neighbours suffer from the curse of dimensionality. We argue this is caused in part by inherent deficiencies of space partitioning, which is the underlying strategy used by most existing methods. We devise a new strategy that avoids partitioning the vector space and present a novel randomized algorithm that runs in time linear in dimensionality of the space and sub-linear in the intrinsic dimensionality and the size of the dataset and takes space constant in dimensionality of the space and linear in the size of the dataset. The proposed algorithm allows fine-grained control over accuracy and speed on a per-query basis, automatically adapts to variations in data density, supports dynamic updates to the dataset and is easy-to-implement. We show appealing theoretical properties and demonstrate empirically that the proposed algorithm outperforms locality-sensitivity hashing (LSH) in terms of approximation quality, speed and space efficiency.
  • 04:32 – Geometric Mean Metric Learning Pourya Zadeh Tehran university, Reshad Hosseini , Suvrit Sra Paper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    We revisit the task of learning a Euclidean metric from data. We approach this problem from first principles and formulate it as a surprisingly simple optimization problem. Indeed, our formulation even admits a closed form solution. This solution possesses several very attractive properties: (i) an innate geometric appeal through the Riemannian geometry of positive definite matrices; (ii) ease of interpretability; and (iii) computational speed several orders of magnitude faster than the widely used LMNN and ITML methods. Furthermore, on standard benchmark datasets, our closed-form solution consistently attains higher classification accuracy.
  • 04:49 – Low-rank tensor completion: a Riemannian manifold preconditioning approach Hiroyuki Kasai The University of Electro-Comm, Bamdev Mishra Amazon Development Centre IndiaPaper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    We propose a novel Riemannian manifold preconditioning approach for the tensor completion problem with rank constraint. A novel Riemannian metric or inner product is proposed that exploits the least-squares structure of the cost function and takes into account the structured symmetry that exists in Tucker decomposition. The specific metric allows to use the versatile framework of Riemannian optimization on quotient manifolds to develop preconditioned nonlinear conjugate gradient and stochastic gradient descent algorithms in batch and online setups, respectively. Concrete matrix representations of various optimization-related ingredients are listed. Numerical comparisons suggest that our proposed algorithms robustly outperform state-of-the-art algorithms across different synthetic and real-world datasets.
  • 05:25 – The Variational Nystrom method for large-scale spectral problems Max Vladymyrov Yahoo Labs, Miguel Carreira-Perpinan UC MercedPaper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    Spectral methods for dimensionality reduction and clustering require solving an eigenproblem defined by a sparse affinity matrix. When this matrix is large, one seeks an approximate solution. The standard way to do this is the Nystrom method, which first solves a small eigenproblem considering only a subset of landmark points, and then applies an out-of-sample formula to extrapolate the solution to the entire dataset. We show that by constraining the original problem to satisfy the Nystrom formula, we obtain an approximation that is computationally simple and efficient, but achieves a lower approximation error using fewer landmarks and less runtime. We also study the role of normalization in the computational cost and quality of the resulting solution.
  • 05:42 – Fast DPP Sampling for Nystro ̈m with Application to Kernel Methods Chengtao Li MIT, Stefanie Jegelka MIT, Suvrit Sra Paper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    The Nystrom method has long been popular for scaling up kernel methods. Its theoretical guarantees and empirical performance rely critically on the quality of the landmarks selected. We study landmark selection for Nystrom using Determinantal Point Processes (DPPs), discrete probability models that allow tractable generation of diverse samples. We prove that landmarks selected via DPPs guarantee bounds on approximation errors; subsequently, we analyze implications for kernel ridge regression. Contrary to prior reservations due to cubic complexity of DPP sampling, we show that (under certain conditions) Markov chain DPP sampling requires only linear time in the size of the data. We present several empirical results that support our theoretical analysis, and demonstrate the superior performance of DPP-based landmark selection compared with existing approaches.
  • 05:59 – Computationally Efficient Nystr\”{o}m Approximation using Fast Transforms Si Si , Cho-Jui Hsieh UC Davis, Inderjit Paper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    Our goal is to improve the {\it training} and {\it prediction} time of Nystr\”{o}m method, which is a widely-used technique for generating low-rank kernel matrix approximations. When applying the Nystr\”{o}m approximation for large-scale applications, both training and prediction time is dominated by computing kernel values between a data point and all landmark points. With $m$ landmark points, this computation requires $\Theta(md)$ time (flops), where $d$ is the input dimension. In this paper, we propose the use of a family of fast transforms to generate structured landmark points for Nystr\”{o}m approximation. By exploiting fast transforms, e.g., Haar transform and Hadamard transform, our modified Nystr\”{o}m method requires only $\Theta(m)$ or $\Theta(m\log d)$ time to compute the kernel values between a given data point and $m$ landmark points. This improvement in time complexity can significantly speed up kernel approximation and benefit prediction speed in kernel machines. For instance, on the webspam data (more than 300,000 data points), our proposed algorithm enables kernel SVM prediction to deliver 98\% accuracy and the resulting prediction time is 1000 times faster than LIBSVM and only 10 times slower than linear SVM prediction (which yields only 91\% accuracy).
  • Monday – Statistical Learning Theory

    Session chair: Ohad Shamir

    Location: Empire
  • 04:15 – Barron and Cover’s Theory in Supervised Learning and its Application to Lasso Masanori Kawakita Kyushu University, Jun’ichi Takeuchi Kyushu UniversityPaper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    We study Barron and Cover’s theory (BC theory) in supervised learning. The original BC theory can be applied to supervised learning only approximately and limitedly. Though Barron (2008) and Chatterjee and Barron (2014) succeeded in removing the approximation, their idea cannot be essentially applied to supervised learning in general. By solving this issue, we propose an extension of BC theory to supervised learning. The extended theory has several advantages inherited from the original BC theory. First, it holds for finite sample number n. Second, it requires remarkably few assumptions. Third, it gives a justification of the MDL principle in supervised learning. We also derive new risk and regret bounds of lasso with random design as its application. The derived risk bound hold for any finite n without boundedness of features in contrast to past work. Behavior of the regret bound is investigated by numerical simulations. We believe that this is the first extension of BC theory to general supervised learning without approximation.
  • 04:32 – Exact Exponent in Optimal Rates for Crowdsourcing Chao Gao Yale University, Yu Lu Yale University, Dengyong Zhou Microsoft ResearchPaper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    Crowdsourcing has become a popular tool for labeling large datasets. This paper studies the optimal error rate for aggregating crowdsourced labels provided by a collection of amateur workers. Under the Dawid-Skene probabilistic model, we establish matching upper and lower bounds with an exact exponent $mI(\pi)$, where $m$ is the number of workers and $I(\pi)$ is the average Chernoff information that characterizes the workers’ collective ability. Such an exact characterization of the error exponent allows us to state a precise sample size requirement $m \ge \frac{1}{I(\pi)}\log\frac{1}{\epsilon}$ in order to achieve an $\epsilon$ misclassification error. In addition, our results imply optimality of various forms of EM algorithms given accurate initializers of the model parameters.
  • 04:49 – Generalization Properties and Implicit Regularization for Multiple Passes SGM Junhong Lin Istituto Italiano di Tecnologi, Raffaello Camoriano IIT Italy and UNIGE Italy, Lorenzo Rosasco Istituto Italiano di Tecnologia, Università degli Studi di Genova and MITPaper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    We study the generalization properties of stochastic gradient methods for learning with convex loss functions and linearly parameterized functions. We show that, in the absence of penalizations or constraints, the stability and approximation properties of the algorithm can be controlled by tuning either the step-size or the number of passes over the data. In this view, these parameters can be seen to control a form of implicit regularization. Numerical results complement the theoretical findings.
  • 05:25 – Generalized Direct Change Estimation in Ising Model Structure Farideh Fazayeli University of Minnesota, Arindam Banerjee Paper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    We consider the problem of estimating change in the dependency structure of two $p$-dimensional Ising models, based on respectively $n_1$ and $n_2$ samples drawn from the models. The change is assumed to be structured, e.g., sparse, block sparse, node-perturbed sparse, etc., such that it can be characterized by a suitable (atomic) norm. We present and analyze a norm-regularized estimator for directly estimating the change in structure, without having to estimate the structures of the individual Ising models. The estimator can work with any norm, and can be generalized to other graphical models under mild assumptions. We show that only one set of samples, say $n_2$, needs to satisfy the sample complexity requirement for the estimator to work, and the estimation error decreases as $\frac{c}{\sqrt{\min(n_1,n_2)}}$, where $c$ depends on the Gaussian width of the unit norm ball. For example, for $\ell_1$ norm applied to $s$-sparse change, the change can be accurately estimated with $\min(n_1,n_2)=O(s \log p)$ which is sharper than an existing result $n_1= O(s^2 \log p)$ and $n_2 = O(n_1^2)$. Experimental results illustrating the effectiveness of the proposed estimator are presented.
  • 05:42 – Gaussian process nonparametric tensor estimator and its minimax optimality Heishiro Kanagawa Tokyo Institute of Technology, Taiji Suzuki , Hayato Kobayashi Yahoo Japan Corporation, Nobuyuki Shimizu , Yukihiro Tagami Yahoo Japan CorporationPaper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    We investigate the statistical efficiency of a nonparametric Gaussian process method
    for a nonlinear tensor estimation problem.
    Low-rank tensor estimation has been used as a method to learn higher order relations among several data sources in a wide range of applications,
    such as multi-task learning, recommendation systems, and spatiotemporal analysis.
    We consider a general setting where a common linear tensor learning is extended to a nonlinear learning problem in
    reproducing kernel Hilbert space and propose a nonparametric Bayesian method based on the Gaussian process method.
    We prove its statistical convergence rate without assuming any strong convexity, such as restricted strong convexity.
    Remarkably, it is shown that our convergence rate achieves the minimax optimal rate.
    We apply our proposed method to multi-task learning and
    show that our method significantly outperforms existing methods through numerical experiments on real-world data sets.
  • 05:59 – Minimum Regret Search for Single- and Multi-Task Optimization Jan Hendrik Metzen University BremenPaper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    We propose minimum regret search (MRS), a novel acquisition function for Bayesian optimization. MRS bears similarities with information-theoretic approaches such as entropy search (ES). However, while ES aims in each query at maximizing the
    information gain with respect to the global maximum, MRS aims at minimizing the expected simple regret of its ultimate recommendation for the optimum. While empirically ES and MRS perform similar in most of the cases, MRS produces fewer outliers with high simple regret than ES. We provide empirical results both for a synthetic single-task optimization problem as well as for a simulated multi-task robotic control problem.
  • Monday – Structured Prediction / Monte Carlo Methods

    Session chair: Martin Jaggi

    Location: Soho
  • 04:15 – The Sum-Product Theorem: A Foundation for Learning Tractable Models Abram Friesen University of Washington, Pedro Paper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    Inference in expressive probabilistic models is generally intractable, which makes them difficult to learn and limits their applicability. Sum-product networks are a class of deep models where, surprisingly, inference remains tractable even when an arbitrary number of hidden layers are present. In this paper, we generalize this result to a much broader set of learning problems: all those where inference consists of summing a function over a semiring. This includes satisfiability, constraint satisfaction, optimization, integration, and others. In any semiring, for summation to be tractable it suffices that the factors of every product have disjoint scopes. This unifies and extends many previous results in the literature. Enforcing this condition at learning time thus ensures that the learned models are tractable. We illustrate the power and generality of this approach by applying it to a new type of structured prediction problem: learning a nonconvex function that can be globally optimized in polynomial time. We show empirically that this greatly outperforms the standard approach of learning without regard to the cost of optimization.
  • 04:32 – Train and Test Tightness of LP Relaxations in Structured Prediction Ofer Meshi , Mehrdad Mahdavi , Adrian Weller University of Cambridge, David Sontag NYUPaper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    Structured prediction is used in areas such as computer vision and natural language processing to predict structured outputs such as segmentations or parse trees. In these settings, prediction is performed by MAP inference or, equivalently, by solving an integer linear program. Because of the complex scoring functions required to obtain accurate predictions, both learning and inference typically require the use of approximate solvers. We propose a theoretical explanation to the striking observation that approximations based on linear programming (LP) relaxations are often tight on real-world instances. In particular, we show that learning with LP relaxed inference encourages integrality of training instances, and that tightness generalizes from train to test data.
  • 04:49 – Evasion and Hardening of Tree Ensemble Classifiers Alex Kantchelian University of California, Berk, J. D. Tygar UC Berkeley, Anthony Joseph UC BerkeleyPaper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    Classifier evasion consists in finding for a given instance $x$ the “nearest” instance $x’$ such that the classifier predictions of $x$ and $x’$ are different. We present two novel algorithms for systematically computing evasions for tree ensembles such as boosted trees and random forests. Our first algorithm uses a Mixed Integer Linear Program solver and finds the optimal evading instance under an expressive set of constraints. Our second algorithm trades off optimality for speed by using symbolic prediction, a novel algorithm for fast finite differences on tree ensembles. On a digit recognition task, we demonstrate that both gradient boosted trees and random forests are extremely susceptible to evasions. Finally, we harden a boosted tree model without loss of predictive accuracy by augmenting the training set of each boosting round with evading instances, a technique we call adversarial boosting.
  • 05:25 – Importance Sampling Tree for Large-scale Empirical Expectation Olivier CANEVET Idiap Research Institut, Cijo Jose Idiap Research Institute/ Éc , Francois Fleuret Idiap research institutePaper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    We propose a tree-based procedure inspired by the Monte-Carlo Tree Search that dynamically modulates an importance-based sampling to prioritize computation, while getting unbiased estimates of weighted sums. We apply this generic method to learning on very large training sets, and to the evaluation of large-scale SVMs.

    The core idea is to reformulate the estimation of a score – whether a loss or a prediction estimate – as an empirical expectation, and to use such a tree whose leaves carry the samples to focus efforts over the problematic “heavy weight” ones.

    We illustrate the potential of this approach on three problems: to improve Adaboost and a multi-layer perceptron on 2D synthetic tasks with several million points, to train a large-scale convolution network on several millions deformations of the CIFAR data-set, and to compute the response of a SVM with several hundreds of thousands of support vectors. In each case, we show how it either cuts down computation by more than one order of magnitude and/or allows to get better loss estimates.

  • 05:42 – Stratified Sampling Meets Machine Learning Edo Liberty , Kevin Lang Yahoo Labs, Konstantin Shmakov Yahoo LabsPaper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    This paper solves a specialized regression problem to obtain sampling probabilities for records in databases. The goal is to sample a small set of records over which evaluating aggregate queries can be done both efficiently and accurately. We provide a principled and provable solution for this problem; it is parameterless and requires no data insights. Unlike standard regression problems, the loss is inversely proportional to the regressed-to values. Moreover, a cost zero solution always exists and can only be excluded by hard budget constraints. A unique form of regularization is also needed. We provide an efficient and simple regularized Empirical Risk Minimization (ERM) algorithm along with a theoretical generalization result. Our extensive experimental results significantly improve over both uniform sampling and standard stratified sampling which are de-facto the industry standards.
  • 05:59 – Scalable Discrete Sampling as a Multi-Armed Bandit Problem Yutian Chen University of Cambridge, Zoubin Paper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    Drawing a sample from a discrete distribution is one of the building components for Monte Carlo methods. Like other sampling algorithms, discrete sampling suffers from the high computational burden in large-scale inference problems. We study the problem of sampling a discrete random variable with a high degree of dependency that is typical in large-scale Bayesian inference and graphical models, and propose an efficient approximate solution with a subsampling approach. We make a novel connection between the discrete sampling and Multi-Armed Bandits problems with a finite reward population and provide three algorithms with theoretical guarantees. Empirical evaluations show the robustness and efficiency of the approximate algorithms in both synthetic and real-world large-scale problems.
  • Tuesday – Neural Networks and Deep Learning

    Session chair: Hal Daume III

    Location: Ballroom 1+2+Juliard
  • 10:30 – Strongly-Typed Recurrent Neural Networks David Balduzzi , Muhammad Ghifary Victoria University Wellington, Weta DigitalPaper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    Recurrent neural networks are increasing popular models for sequential learning. Unfortunately, although the most effective RNN architectures are perhaps excessively complicated, extensive searches have not found simpler alternatives. This paper imports ideas from physics and functional programming into RNN design to provide guiding principles. From physics, we introduce type constraints, analogous to the constraints that forbids adding meters to seconds. From functional programming, we require that strongly-typed architectures factorize into stateless learnware and state-dependent firmware, reducing the impact of side-effects. The features learned by strongly-typed nets have a simple semantic interpretation via dynamic average-pooling on one-dimensional convolutions. We also show that strongly-typed gradients are better behaved than in classical architectures, and characterize the representational power of strongly-typed nets. Finally, experiments show that, despite being more constrained, strongly-typed architectures achieve lower training and comparable generalization error to classical architectures.
  • 10:47 – A Convolutional Attention Network for Extreme Summarization of Source Code Miltiadis Allamanis University of Edinburgh, UK, Hao Peng Peking University, China, Charles Sutton Paper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    Attention mechanisms in neural networks have proved useful for problems in which the input and output do not have fixed dimension. Often there exist features that are locally translation invariant and would be valuable for directing the model’s attention, but previous attentional architectures are not constructed to learn such features specifically. We introduce an attentional neural network that employs convolution on the input tokens to detect local time-invariant and long-range topical attention features in a context-dependent way. We apply this architecture to the problem of extreme summarization of source code snippets into short, descriptive function name-like summaries. Using those features, the model sequentially generates a summary by marginalizing over two attention mechanisms: one that predicts the next summary token based on the attention weights of the input tokens and another that is able to copy a code token as-is directly into the summary. We demonstrate our convolutional attention neural network’s performance on 10 popular Java projects showing that it achieves better performance compared to previous attentional mechanisms.
  • 11:04 – Ask Me Anything: Dynamic Memory Networks for Natural Language Processing Ankit Kumar MetaMind, Ozan Irsoy MetaMind, Peter Ondruska , Mohit Iyyer MetaMind, James Bradbury MetaMind, Ishaan Gulrajani MetaMind, Victor Zhong MetaMind, Romain Paulus MetaMind, Richard Socher Paper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    Most tasks in natural language processing can be cast into question answering (QA) problems over language input.
    We introduce the dynamic memory network (DMN), a neural network architecture which processes input sequences and questions, forms episodic memories, and generates relevant answers. Questions trigger an iterative attention process which allows the model to condition its attention on the inputs and the result of previous iterations. These results are then reasoned over in a hierarchical recurrent sequence model to generate answers.
    The DMN can be trained end-to-end and obtains state-of-the-art results on several types of tasks and datasets:
    question answering (Facebook’s bAbI dataset),
    text classification for sentiment analysis (Stanford Sentiment Treebank) and
    sequence modeling for part-of-speech tagging (WSJ-PTB).
    The training for these different tasks relies exclusively on trained word vector representations and input-question-answer triplets.
  • 11:40 – Dynamic Memory Networks for Visual and Textual Question Answering Caiming Xiong MetaMind, Stephen Merity MetaMind, Richard Socher Paper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    Neural network architectures with memory and attention mechanisms exhibit certain reason- ing capabilities required for question answering. One such architecture, the dynamic memory net- work (DMN), obtained high accuracy on a variety of language tasks. However, it was not shown whether the architecture achieves strong results for question answering when supporting facts are not marked during training or whether it could be applied to other modalities such as images. Based on an analysis of the DMN, we propose several improvements to its memory and input modules. Together with these changes we introduce a novel input module for images in order to be able to answer visual questions. Our new DMN+ model improves the state of the art on both the Visual Question Answering dataset and the bAbI-10k text question-answering dataset without supporting fact supervision.
  • 11:57 – Supervised and Semi-Supervised Text Categorization using LSTM for Region Embeddings Rie Johnson RJ Research Consulting, Tong Zhang Paper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    One-hot CNN (convolutional neural network) has been shown to be effective for text categorization (Johnson & Zhang, 2015). We view it as a special case of a general framework which jointly trains a linear model with a non-linear feature generator consisting of `text region embedding + pooling’. Under this framework, we explore a more sophisticated region embedding method using Long Short-Term Memory (LSTM). LSTM can embed text regions of variable (and possibly large) sizes, whereas the region size needs to be fixed in a CNN. We seek effective and efficient use of LSTM for this purpose in the supervised and semi-supervised settings. The best results were obtained by combining region embeddings in the form of LSTM and convolution layers trained on unlabeled data. The results indicate that on this task, embeddings of text regions, which can convey complex concepts, are more useful than embeddings of single words in isolation. We report performances exceeding the previous best results on four benchmark datasets.
  • 12:14 – PHOG: Probabilistic Model for Code Pavol Bielik ETH Zurich, Veselin Raychev ETH Zurich, Martin Vechev ETH ZurichPaper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    We introduce a new generative model for code called probabilistic higher order grammar (PHOG). PHOG generalizes probabilistic context free grammars (PCFGs) by allowing conditioning of a production rule beyond the parent non-terminal, thus capturing rich contexts relevant to programs. Even though PHOG is more powerful than a PCFG, it can be learned from data just as efficiently.
    We trained a PHOG model on a large JavaScript code corpus and show that it is more precise than existing models, while similarly fast. As a result, PHOG can immediately benefit existing programming tools based on probabilistic models of code.
  • Tuesday – Reinforcement Learning

    Session chair: Tom Erez

    Location: Ballroom 3+4
  • 10:30 – On the Analysis of Complex Backup Strategies in Monte Carlo Tree Search Piyush Khandelwal University of Texas at Austin, Elad Liebman , Scott , Peter Stone U. of TexasPaper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    Over the past decade, Monte Carlo Tree Search (MCTS) and specifically Upper Confidence Bound in Trees (UCT) have proven to be quite effective in large probabilistic planning domains. In this paper, we focus on how values are backpropagated in the MCTS tree, and apply complex return strategies from the Reinforcement Learning (RL) literature to MCTS, producing 4 new MCTS variants. We demonstrate that in some probabilistic planning benchmarks from the International Planning Competition (IPC), selecting a MCTS variant with a backup strategy different from Monte Carlo averaging can lead to substantially better results. We also propose a hypothesis for why different backup strategies lead to different performance in particular environments, and manipulate a carefully structured grid-world domain to provide empirical evidence supporting our hypothesis.
  • 10:47 – Generalization and Exploration via Randomized Value Functions Ian Osband Stanford, Benjamin Van Roy Stanford University, Zheng Wen Adobe ResearchPaper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    We propose randomized least-squares value iteration (RLSVI) — a new reinforcement learning algorithm designed to explore and generalize efficiently via linearly parameterized value functions.
    We explain why versions of least-squares value iteration that use Boltzmann or epsilon-greedy exploration can be highly inefficient, and we present computational results that demonstrate dramatic efficiency gains enjoyed by RLSVI.
    Further, we establish an upper bound on the expected regret of RLSVI that demonstrates near-optimality in a tabula rasa learning context.
    More broadly, our results suggest that randomized value functions offer a promising approach to tackling a critical challenge in reinforcement learning: synthesizing efficient exploration and effective generalization.
  • 11:04 – Doubly Robust Off-policy Value Evaluation for Reinforcement Learning Nan Jiang University of Michigan, Lihong Li MicrosoftPaper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    We study the problem of off-policy value evaluation in reinforcement learning (RL), where one aims to estimate the value of a new policy based on data collected by a different policy. This problem is often a critical step when applying RL to real-world problems. Despite its importance, existing general methods either have uncontrolled bias or suffer high variance. In this work, we extend the doubly robust estimator for bandits to sequential decision-making problems, which gets the best of both worlds: it is guaranteed to be unbiased and can have a much lower variance than the popular importance sampling estimators. We demonstrate the estimator’s accuracy in several benchmark problems, and illustrate its use as a subroutine in safe policy improvement. We also provide theoretical results on the inherent hardness of the problem, and show that our estimator can match the lower bound in certain scenarios.
  • 11:40 – Near Optimal Behavior via Approximate State Abstraction David Abel Brown University, David Hershkowitz Brown University, Michael Littman Paper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    The combinatorial explosion that plagues planning and reinforcement learning (RL) algorithms can be moderated using state abstraction. Prohibitively large task representations can be condensed such that essential information is preserved, and consequently, solutions are tractably computable. However, exact abstractions, which treat only fully-identical situations as equivalent, fail to present opportunities for abstraction in environments where no two situations are exactly alike. In this work, we investigate approximate state abstractions, which treat nearly-identical situations as equivalent. We present theoretical guarantees of the quality of behaviors derived from four types of approximate abstractions. Additionally, we empirically demonstrate that approximate abstractions lead to reduction in task complexity and bounded loss of optimality of behavior in a variety of environments.
  • 11:57 – Model-Free Trajectory Optimization\\ for Reinforcement Learning Riad Akrour TU Darmstadt, Gerhard Neumann , Hany Abdulsamad , Abbas Abdolmaleki Paper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    Many of the recent Trajectory Optimization algorithms alternate between local approximation of the dynamics and conservative
    policy update. However, linearly approximating the dynamics in order to derive the new policy can bias the update and prevent convergence to the optimal policy. In this article, we propose a new model-free algorithm that
    backpropagates a local quadratic time-dependent Q-Function, allowing the derivation of the policy update in closed form. Our policy update
    ensures exact KL-constraint satisfaction without simplifying assumptions on the system dynamics demonstrating improved performance in comparison to related Trajectory Optimization algorithms linearizing the dynamics.
  • 12:14 – Model-Free Imitation Learning with Policy Optimization Jonathan Ho Stanford, Jayesh Gupta Stanford University, Stefano Ermon Paper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    In imitation learning, an agent learns how to behave in an environment with an unknown cost function by mimicking expert demonstrations. Existing imitation learning algorithms typically involve solving a sequence of planning or reinforcement learning problems. Such algorithms are therefore not directly applicable to large, high-dimensional environments, and their performance can significantly degrade if the planning problems are not solved to optimality. Under the apprenticeship learning formalism, we develop alternative model-free algorithms for finding a parameterized stochastic policy that performs at least as well as an expert policy on an unknown cost function, based on sample trajectories from the expert. Our approach, based on policy gradients, scales to large continuous environments with guaranteed convergence to local minima.
  • Session chair: Lihong Li

    Location: Marquis
  • 03:40 – Guided Cost Learning: Deep Inverse Optimal Control via Policy Optimization Chelsea Finn UC Berkeley, Sergey Levine , Pieter Abbeel BerkeleyPaper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    Reinforcement learning can acquire complex behaviors from high-level specifications. However, defining a cost function that can be optimized effectively and encodes the correct task is challenging in practice. We explore how inverse optimal control (IOC) can be used to learn behaviors from demonstrations, with applications to torque control of high-dimensional robotic systems. Our method addresses two key challenges in inverse optimal control: first, the need for informative features and effective regularization to impose structure on the cost, and second, the difficulty of learning the cost function under unknown dynamics for high-dimensional continuous systems. To address the former challenge, we present an algorithm capable of learning arbitrary nonlinear cost functions, such as neural networks, without meticulous feature engineering. To address the latter challenge, we formulate an efficient sample-based approximation for MaxEnt IOC. We evaluate our method on a series of simulated tasks and real-world robotic manipulation problems, demonstrating substantial improvement over prior methods both in terms of task complexity and sample efficiency.
  • 03:57 – Smooth Imitation Learning for Online Sequence Prediction Hoang Le Caltech, Andrew Kang , Yisong Yue Caltech, Peter Carr Paper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    We study the problem of smooth imitation learning for online sequence prediction, where the goal is to train a policy that can smoothly imitate demonstrated behavior in a dynamic and continuous environment in response to online, sequential context input. Since the mapping from context to behavior is often complex, we take a learning reduction approach to reduce smooth imitation learning to a regression problem using complex function classes that are regularized to ensure smoothness. We present a learning meta-algorithm that achieves fast and stable convergence to a good policy. Our approach enjoys several attractive properties, including being fully deterministic, employing an adaptive learning rate that can provably yield larger policy improvements compared to previous approaches, and the ability to ensure stable convergence. Our empirical results demonstrate significant performance gains over previous approaches.
  • 04:14 – Continuous Deep Q-Learning with Model-based Acceleration Shixiang Gu University of Cambridge, Timothy Lillicrap Google DeepMind, Ilya Sutskever OpenAI, Sergey Levine GooglePaper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    Model-free reinforcement learning has been successfully applied to a range of challenging problems, and has recently been extended to handle large neural network policies and value functions. However, the sample complexity of model-free algorithms, particularly when using high-dimensional function approximators, tends to limit their applicability to physical systems. In this paper, we explore algorithms and representations to reduce the sample complexity of deep reinforcement learning for continuous control tasks. We propose two complementary techniques for improving the efficiency of such algorithms. First, we derive a continuous variant of the Q-learning algorithm, which we call normalized advantage functions (NAF), as an alternative to the more commonly used policy gradient and actor-critic methods. NAF representation allows us to apply Q-learning with experience replay to continuous tasks, and substantially improves performance on a set of simulated robotic control tasks. To further improve the efficiency of our approach, we explore the use of learned models for accelerating model-free reinforcement learning. We show that iteratively refitted local linear models are especially effective for this, and demonstrate substantially faster learning on domains where such models are applicable.
  • 04:31 – Asynchronous Methods for Deep Reinforcement Learning Volodymyr Mnih Google DeepMind, Adria Puigdomenech Badia Google DeepMind, Mehdi Mirza , Alex Graves Google DeepMind, Timothy Lillicrap Google DeepMind, Tim Harley Google DeepMind, David Silver Google Deepmind, Koray Kavukcuoglu Google DeepmindPaper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    We propose a conceptually simple and lightweight framework for deep reinforcement learning that uses asynchronous gradient descent for optimization of deep neural network controllers. We present asynchronous variants of four standard reinforcement learning algorithms and show that parallel actor-learners have a stabilizing effect on training allowing all four methods to successfully train neural network controllers. The best performing method, an asynchronous variant of actor-critic, surpasses the current state-of-the-art on the Atari domain while training for half the time on a single multi-core CPU instead of a GPU. Furthermore, we show that asynchronous actor-critic succeeds on a wide variety of continuous motor control problems as well as on a new task of navigating random 3D mazes using a visual input.
  • Session chair: Tom Erez

    Location: Marquis
  • 05:10 – Estimating Maximum Expected Value through Gaussian Approximation Carlo D’Eramo Politecnico di Milano, Marcello Restelli Politecnico di Milano, Alessandro Nuara Politecnico di MilanoPaper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    This paper is about the estimation of the maximum expected value of a set of independent random variables.
    The performance of several learning algorithms (e.g., Q-learning) is affected by the accuracy of such estimation.
    Unfortunately, no unbiased estimator exists.
    The usual approach of taking the maximum of the sample means leads to large overestimates that may significantly harm the performance of the learning algorithm.
    Recent works have shown that the cross validation estimator—which is negatively biased—outperforms the maximum estimator in many sequential decision-making scenarios.
    On the other hand, the relative performance of the two estimators is highly problem-dependent.
    In this paper, we propose a new estimator for the maximum expected value, based on a weighted average of the sample means, where the weights are computed using Gaussian approximations for the distributions of the sample means.
    We compare the proposed estimator with the other state-of-the-art methods both theoretically, by deriving upper bounds to the bias and the variance of the estimator, and empirically, by testing the performance on different sequential learning problems.
  • 05:27 – Data-Efficient Off-Policy Policy Evaluation for Reinforcement Learning Philip Thomas CMU, Emma Paper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    In this paper we present a new way of predicting the performance of a reinforcement learning policy given historical data that may have been generated by a different policy. The ability to evaluate a policy from historical data is important for applications where the deployment of a bad policy can be dangerous or costly. We show empirically that our algorithm produces estimates that often have orders of magnitude lower mean squared error than existing methods—it makes more efficient use of the available data. Our new estimator is based on two advances: an extension of the doubly robust estimator (Jiang & Li, 2015), and a new way to mix between model based and importance sampling based estimates.
  • 05:44 – Cumulative Prospect Theory Meets Reinforcement Learning: Prediction and Control Prashanth L.A. University of Maryland , Cheng Jie University of Maryland – College Park, Michael Fu University of Maryland – College Park, Steve Marcus University of Maryland – College Park, Csaba Szepesvari AlbertaPaper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    Cumulative prospect theory (CPT) is known to model human decisions well, with substantial empirical evidence supporting this claim. CPT works by distorting probabilities and is more general than the classic expected utility and coherent risk measures. We bring this idea to a risk-sensitive reinforcement learning (RL) setting and design algorithms for both estimation and control. The RL setting presents two particular challenges when CPT is applied: estimating the CPT objective requires estimations of the entire distribution of the value function and finding a randomized optimal policy. The estimation scheme that we propose uses the empirical distribution to estimate the CPT-value of a random variable. We then use this scheme in the inner loop of a CPT-value optimization procedure that is based on the well-known simulation optimization idea of simultaneous perturbation stochastic approximation (SPSA).
    We provide theoretical convergence guarantees for all the proposed algorithms and also empirically demonstrate the usefulness of our algorithms.
  • 06:01 – Softened Approximate Policy Iteration for Markov Games Julien Pérolat Univ. Lille, Bilal Piot Univ. Lille, Matthieu Geist , Bruno Scherrer , Olivier Pietquin Univ. Lille, CRIStAL, UMR 9189, SequeL Team, Villeneuve d’Ascq, 59650, FRANCEPaper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    This paper reports theoretical and empirical investigations on the use of quasi-Newton methods to minimize the Optimal Bellman Residual (OBR) of zero-sum two-player Markov Games. First, it reveals that state-of-the-art algorithms can be derived by the direct application of Newton’s method to different norms of the OBR. More precisely, when applied to the norm of the OBR, Newton’s method results in the Bellman Residual Minimization Policy Iteration (BRMPI) and, when applied to the norm of the Projected OBR (POBR), it results into the standard Least Squares Policy Iteration (LSPI) algorithm. Consequently, new algorithms are proposed, making use of quasi-Newton methods to minimize the OBR and the POBR so as to take benefit of enhanced empirical performances at low cost. Indeed, using a quasi-Newton method approach introduces slight modifications in term of coding of LSPI and BRMPI but improves significantly both the stability and the performance of those algorithms. These phenomena are illustrated on an experiment conducted on artificially constructed games called Garnets.
  • Tuesday – Optimization (Combinatorial)

    Session chair: Andreas Krause

    Location: Marquis
  • 10:30 – Algorithms for Optimizing the Ratio of Submodular Functions Wenruo Bai University of Washington, Rishabh Iyer , Kai Wei , Jeff Bilmes U. of WashingtonPaper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    We investigate a new optimization problem involving minimizing the Ratio of Submodular (RS) functions. We argue that this problem occurs naturally in several real world applications. We then show the connection between this problem and several related problems, including minimizing the difference of submodular functions, and to submodular optimization subject to submodular constraints. We show RS that optimization can be solved within bounded approximation factors. We also provide a hardness bound and show that our tightest algorithm matches the lower bound up to a $\log$ factor. Finally, we empirically demonstrate the performance and good scalability properties of our algorithms.
  • 10:47 – Horizontally Scalable Submodular Maximization Mario Lucic ETH Zurich, Olivier Bachem ETH Zurich, Morteza Zadimoghaddam Google Research, Andreas Krause Paper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    A variety of large-scale machine learning problems can be cast as instances of constrained submodular maximization. Existing approaches for distributed submodular maximization have a critical drawback: The capacity – number of instances that can fit in memory – must grow with the data set size. In practice, while one can provision many machines, the capacity of each machine is limited by physical constraints. We propose a truly scalable approach for distributed submodular maximization under fixed capacity. The proposed framework applies to a broad class of algorithms and constraints and provides theoretical guarantees on the approximation factor for any available capacity. We empirically evaluate the proposed algorithm on a variety of data sets and demonstrate that it achieves performance competitive with the centralized greedy solution.
  • 11:04 – Learning Sparse Combinatorial Representations via Two-stage Submodular Maximization Eric Balkanski , Baharan Mirzasoleiman ETH Zurich, Andreas Krause , Yaron Singer Paper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    We consider the problem of learning sparse representations of data sets, where the goal is to reduce a data set in manner that optimizes multiple objectives. Motivated by applications of data summarization, we develop a new model which we refer to as the two-stage submodular maximization problem. This task can be viewed as a combinatorial analogue of representation learning problems such as dictionary learning and sparse regression. The two-stage problem strictly generalizes the problem of cardinality constrained submodular maximization, though the objective function is not submodular and the techniques for submodular maximization cannot be applied. We describe a continuous optimization method which achieves an approximation ratio which asymptotically approaches 1-1/e. For instances where the asymptotics do not kick in, we design a local-search algorithm whose approximation ratio is arbitrarily close to 1/2. We empirically demonstrate the effectiveness of our methods on two multi-objective data summarization tasks, where the goal is to construct summaries via sparse representative subsets w.r.t. to predefined objectives.
  • 11:40 – Fast Constrained Submodular Maximization: Personalized Data Summarization Baharan Mirzasoleiman ETH Zurich, Ashwinkumar Badanidiyuru Google Research, Amin Karbasi Yale UniversityPaper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    Can we summarize multi-category data based on user preferences in a scalable manner? Many utility functions used for data summarization satisfy submodularity, a natural diminishing returns property. We cast personalized data summarization as an instance of a general submodular maximization problem subject to multiple constraints. We develop the first practical and FAst coNsTrained submOdular Maximization algorithm, FANTOM, with strong theoretical guarantees. FANTOM maximizes a submodular function (not necessarily monotone) subject to intersection of a p-system and l knapsacks constrains. It achieves a (1 + ε)(p + 1)(2p + 2l + 1)/p approximation guarantee with only O(nrp log(n)/ε) query complexity (n and r indicate the size of the ground set and the size of the largest feasible solution, respectively). We then show how we can use FANTOM for personalized data summarization. In particular, a p-system can model different aspects of data, such as categories or time stamps, from which the users choose. In addition, knapsacks encode users’ constraints including budget or time. In our set of experiments, we consider several concrete applications: movie recommendation over 11K movies, personalized image summarization with 10K images, and revenue maximization on the YouTube social networks with 5000 communities. We observe that FANTOM constantly provides the highest utility against all the baselines.
  • 11:57 – A Box-Constrained Approach for Hard Permutation Problems Cong Han Lim Univ of Wisconsin – Madison, Steve Wright University of Wisconsin-MadisonPaper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    We describe the use of sorting networks to form relaxations of problems involving permutations of $n$ objects. This approach is an alternative to relaxations based on the Birkhoff polytope (the set of $n \times n$ doubly stochastic matrices), providing a more compact formulation in which the only constraints are box constraints. Using this approach, we form a variant of the relaxation of the quadratic assignment problem recently studied in Vogelstein et al. (2015), and show that the continuation method applied to this formulation can be quite effective. We develop a coordinate descent algorithm that achieves a per-cycle complexity of $O(n^2 \log^2 n)$. We compare this method with Fast Approximate QAP (FAQ) algorithm introduced in Vogelstein et al. (2015), which uses a conditional-gradient method whose per-iteration complexity is $O(n^3)$. We demonstrate that for most problems in QAPLIB and for a class of synthetic QAP problems, the sorting-network formulation returns solutions that are competitive with the FAQ algorithm, often in significantly less computing time.
  • 12:14 – A Convex Atomic-Norm Approach to Multiple Sequence Alignment and Motif Discovery Ian En-Hsu Yen University of Texas at Austin, Xin Lin University of Texas at Austin, Jiong Zhang University of Texas at Austin, Pradeep Ravikumar UT Austin, Inderjit Paper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    Multiple Sequence Alignment and Motif Discovery, known as NP-hard problems, are two fundamental tasks in Bioinformatics. Existing approaches to these two problems are based on either local search methods such as Expectation Maximization (EM), Gibbs Sampling or greedy heuristic methods. In this work, we develop a convex relaxation approach to both problems based on the recent concept of atomic norm and develop a new algorithm, termed Greedy Direction Method of Multiplier, for solving the convex relaxation with two convex atomic constraints. Experiments show that our convex relaxation approach produces solutions of higher quality than those standard tools widely-used in Bioinformatics community on the Multiple Sequence Alignment and Motif Discovery problems.
  • Tuesday – Unsupervised Learning / Representation Learning

    Session chair: Jennifer Dy

    Location: Lyceum
  • 10:30 – Nonparametric Canonical Correlation Analysis Tomer Michaeli Technion, Weiran Wang , Karen Livescu TTI ChicagoPaper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    Canonical correlation analysis (CCA) is a classical representation learning technique for finding correlated variables in multi-view data. Several nonlinear extensions of the original linear CCA have been proposed, including kernel and deep neural network methods. These approaches seek maximally correlated projections among families of functions, which the user specifies (by choosing a kernel or neural network structure), and are computationally demanding. Interestingly, the theory of nonlinear CCA, without functional restrictions, had been studied in the population setting by Lancaster already in the 1950s, but these results have not inspired practical algorithms. We revisit Lancaster’s theory to devise a practical algorithm for nonparametric CCA (NCCA). Specifically, we show that the solution can be expressed in terms of the singular value decomposition of a certain operator associated with the joint density of the views. Thus, by estimating the population density from data, NCCA reduces to solving an eigenvalue system, superficially like kernel CCA but, importantly, without requiring the inversion of any kernel matrix. We also derive a partially linear CCA (PLCCA) variant in which one of the views undergoes a linear projection while the other is nonparametric. Using a kernel density estimate based on a small number of nearest neighbors, our NCCA and PLCCA algorithms are memory-efficient, often run much faster, and perform better than kernel CCA and comparable to deep CCA.
  • 10:47 – The Information Sieve Greg Ver Steeg Information Sciences Institute, Aram Galstyan Information Sciences InstitutePaper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    We introduce a new framework for unsupervised learning of representations based on a novel hierarchical decomposition of information.
    Intuitively, data is passed through a series of progressively fine-grained sieves.
    Each layer of the sieve recovers a single latent factor that is maximally informative about multivariate dependence in the data.
    The data is transformed after each pass so that the remaining unexplained information trickles down to the next layer.
    Ultimately, we are left with a set of latent factors explaining all the dependence in the original data and remainder information consisting of independent noise.
    We present a practical implementation of this framework for discrete variables and apply it to a variety of fundamental tasks in unsupervised learning including independent component analysis, lossy and lossless compression, and predicting missing values in data.
  • 11:04 – Gromov-Wasserstein Averaging of Kernel and Distance Matrices Gabriel Peyré , Marco Cuturi Kyoto, Justin Solomon Paper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    This paper presents a new technique for computing the barycenter of a set of distance or kernel matrices. These matrices, which define the inter-relationships between points sampled from individual domains, are not required to have the same size or to be in row-by-row correspondence. We compare these matrices using the softassign criterion, which measures the minimum distortion induced by a probabilistic map from the rows of one similarity matrix to the rows of another; this criterion amounts to a regularized version of the Gromov-Wasserstein (GW) distance between metric-measure spaces. The barycenter is then defined as a Fréchet mean of the input matrices with respect to this criterion, minimizing a weighted sum of softassign values. We provide a fast iterative algorithm for the resulting nonconvex optimization problem, built upon state-of- the-art tools for regularized optimal transportation. We demonstrate its application to the computation of shape barycenters and to the prediction of energy levels from molecular configurations in quantum chemistry.
  • 11:40 – Learning Representations for Counterfactual Inference Fredrik Johansson Chalmers Technical University, Uri Shalit , David Sontag NYUPaper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    Observational studies are rising in importance due to the widespread accumulation of data in fields such as healthcare, education, employment and ecology. We consider the task of answering counterfactual questions such as, “Would this patient have lower blood sugar had she received a different medication?”.

    We propose a new algorithmic framework for counterfactual inference which brings together ideas from domain adaptation and representation learning. In addition to a theoretical justification, we perform an empirical comparison with previous approaches to causal inference from observational data. Our deep learning algorithm significantly outperforms the previous state-of-the-art.

  • 11:57 – Why Regularized Auto-Encoders learn Sparse Representation? Devansh Arpit SUNY Buffalo, Yingbo Zhou SUNY Buffalo, Hung Ngo SUNY Buffalo, Venu Govindaraju SUNY BuffaloPaper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    Sparse distributed representation is the key to learning useful features in deep
    learning algorithms, because not only it is an efficient mode of data
    representation, but also — more importantly — it captures the generation
    process of most real world data. While a number of regularized auto-encoders
    (AE) enforce sparsity explicitly in their learned representation and others don’t, there has been little formal analysis on what encourages sparsity in these
    models in general. Our objective is to formally study this general problem for
    regularized auto-encoders. We provide sufficient conditions on both regularization
    and activation functions that encourage sparsity. We show that multiple popular
    models (de-noising and contractive auto encoders, e.g.) and activations
    (rectified linear and sigmoid, e.g.) satisfy these conditions; thus, our
    conditions help explain sparsity in their learned representation. Thus our
    theoretical and empirical analysis together shed light on the properties of
    regularization/activation that are conductive to sparsity and unify
    a number of existing auto-encoder models and activation functions under the same
    analytical framework.
  • 12:14 – Robust Random Cut Forest Based Anomaly Detection on Streams Sudipto Guha University of Pennsylvania, Nina Mishra , Gourav Roy Amazon, Okke Schrijvers Stanford UniversityPaper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    In this paper we focus on the anomaly detection problem for dynamic data streams through the lens of random cut forests. We investigate a robust random cut data structure that can be used as a sketch or synopsis of the input stream. We provide a plausible definition of non-parametric anomalies based on the influence of an unseen point on the remainder of the data, i.e., the externality imposed by that point. We show how the sketch can be efficiently updated in a dynamic data stream. We demonstrate the viability of the algorithm on publicly available real data.
  • Tuesday – Sampling / Kernel Methods

    Session chair: Marius Kloft

    Location: Empire
  • 10:30 – Mixing Rates for the Alternating Gibbs Sampler over Restricted Boltzmann Machines and Friends Christopher Tosh UC San DiegoPaper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    Alternating Gibbs sampling is a modification of classical Gibbs sampling where several variables are simultaneously sampled from their joint conditional distribution. In this work, we investigate the mixing rate of alternating Gibbs sampling with a particular emphasis on Restricted Boltzmann Machines (RBMs) and variants.
  • 10:47 – Pliable Rejection Sampling Akram Erraqabi Inria Lille Nord Europe, Michal Valko Inria Lille – Nord Europe, Alexandra Carpentier , Odalric Maillard InriaPaper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    Rejection sampling is a technique for sampling from difficult distributions. However, its use is limited due to a high rejection rate. Common adaptive rejection sampling methods either work only for very specific distributions or without performance guarantees. In this paper, we present pliable rejection sampling (PRS), a new approach to rejection sampling, where we learn the sampling proposal using a kernel estimator. Since our method builds on rejection sampling, the samples obtained are with high probability i.i.d. and distributed according to f. Moreover, PRS comes with a guarantee on the number of accepted samples.
  • 11:04 – A Kernel Test of Goodness of Fit Kacper.chwialkowski@ Chwialkowski Ucl, Heiko Strathmann University College London, Arthur Gretton UCL GatsbyPaper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    We propose a nonparametric statistical test for goodness-of-fit: given a set of samples, the test determines how likely it is that these were generated from a target density function. The measure of goodness-of-fit is a divergence constructed via Stein’s method using functions from a Reproducing Kernel Hilbert Space. Our test statistic is based on an empirical estimate of this divergence, taking the form of a V-statistic in terms of the log gradients of the target density and the kernel. We derive a statistical test, both for i.i.d. and non-i.i.d. samples, where we estimate the null distribution quantiles using a wild bootstrap procedure. We apply our test to quantifying convergence of approximate Markov Chain Monte Carlo methods, statistical model criticism, and evaluating quality of fit vs model complexity in nonparametric density estimation.
  • 11:40 – A Kernelized Stein Discrepancy for Goodness-of-fit Tests qiang liu , Jason Lee UC Berkeley, Michael Paper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    We derive a new discrepancy statistic for measuring differences between two probability distributions based on combining Stein’s identity and the reproducing kernel Hilbert space theory. We apply our result to test how well a probabilistic model fits a set of observations, and derive a new class of powerful goodness-of-fit tests that are widely applicable for complex and high dimensional distributions, even for those with computationally intractable normalization constants. Both theoretical and empirical properties of our methods are studied thoroughly.
  • 11:57 – Additive Approximations in High Dimensional Nonparametric Regression via the SALSA Kirthevasan Kandasamy Carnegie Mellon University, Yaoliang Yu Paper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    High dimensional nonparametric regression is an inherently difficult problem with
    known lower bounds depending exponentially in dimension.
    A popular strategy to alleviate this curse of dimensionality
    has been to use additive models of \emph{first order}, which model the regression
    function as a sum of independent functions on each dimension.
    Though useful in controlling the variance of the estimate, such models are
    often too restrictive in practical settings.
    Between non-additive models which often have large variance and first order
    additive models which have large bias, there has been little work to
    exploit the trade-off in the middle via additive models of intermediate order.
    In this work, we propose \salsa, which bridges this gap by allowing
    interactions between variables, but controls model capacity by limiting the order of
    \salsas minimises the residual sum of squares with squared RKHS norm penalties.
    Algorithmically, it can be viewed as Kernel Ridge Regression with an additive kernel.
    When the regression function is additive, the excess risk is only polynomial
    in dimension.
    Using the Girard-Newton formulae, we efficiently sum over a combinatorial number
    of terms in the additive expansion.
    Via a comparison on $15$ real datasets, we show that our method is competitive
    against $21$ other alternatives.
  • 12:14 – Doubly Decomposing Nonparametric Tensor Regression Masaaki Imaizumi University of Tokyo, Kohei Hayashi NIIPaper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    Nonparametric extension of tensor regression is proposed. Nonlinearity in a high-dimensional tensor space is broken into simple local functions by incorporating low-rank tensor decomposition. Compared to naive nonparametric approaches, our formulation considerably improves the convergence rate of estimation while maintaining consistency with the same function class under specific conditions. To estimate local functions, we develop a Bayesian estimator with the Gaussian process prior. Experimental results show its theoretical properties and high performance in terms of predicting a summary statistic of a real complex network.
  • Tuesday – Sparsity and Compressed Sensing

    Session chair: Gal Chechik

    Location: Soho
  • 10:30 – The Information-Theoretic Requirements of Subspace Clustering with Missing Data Daniel Pimentel-Alarcon UW-Madison, Robert Nowak UW MadisonPaper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    Subspace clustering with missing data (SCMD) is a useful tool for analyzing incomplete datasets. Let d be the ambient dimension, and r the dimension of the subspaces. Existing theory shows that Nk = O(r d) columns per subspace are necessary for SCMD, and Nk =O(min{ d^(log d), d^(r+1) }) are sufficient. We close this gap, showing that Nk =O(r d) is also sufficient. To do this we derive deterministic sampling conditions for SCMD, which give precise information theoretic requirements and determine sampling regimes. These results explain the performance of SCMD algorithms from the literature. Finally, we give a practical algorithm to certify the output of any SCMD method deterministically.
  • 10:47 – Robust Principal Component Analysis with Side Information Kai-Yang Chiang UT Austin, Cho-Jui Hsieh UC Davis, Inderjit Paper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    The robust principal component analysis (robust PCA) problem has been considered in many machine learning applications, where the goal is to decompose the data matrix as a low rank part plus a sparse residual. While current approaches are developed by only considering the low rank plus sparse structure, in many applications, side information of row and/or column entities may also be given, and it is still unclear to what extent could such information help robust PCA. Thus, in this paper, we study the problem of robust PCA with side information, where both prior structure and features of entities are exploited for recovery. We propose a convex problem to incorporate side information in robust PCA and show that the low rank matrix can be exactly recovered via the proposed method under certain conditions. In particular, our guarantee suggests that a substantial amount of low rank matrices, which cannot be recovered by standard robust PCA, become recoverable by our proposed method. The result theoretically justifies the effectiveness of features in robust PCA. In addition, we conduct synthetic experiments as well as a real application on noisy image classification to show that our method also improves the performance in practice by exploiting side information.
  • 11:04 – Online Low-Rank Subspace Clustering by Basis Dictionary Pursuit Jie Shen Rutgers University, Ping Li Rutgers, Huan Xu Paper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    Low-Rank Representation~(LRR) has been a significant method for segmenting data that are generated from a union of subspaces. It is also known that solving LRR is challenging in terms of time complexity and memory footprint, in that the size of the nuclear norm regularized matrix is n-by-n (where n is the number of samples). In this paper, we thereby develop a novel online implementation of LRR that reduces the memory cost from O(n^2) to O(pd), with p being the ambient dimension and d being some estimated rank (d < p < n). We also establish the theoretical guarantee that the sequence of solutions produced by our algorithm converges to a stationary point of the expected loss function asymptotically. Extensive experiments on synthetic and realistic datasets further substantiate that our algorithm is fast, robust and memory efficient.
  • 11:40 – Provable Non-convex Phase Retrieval with Outliers: Median TruncatedWirtinger Flow Huishuai Zhang Syracuse University, Yuejie Chi Ohio State University, Yingbin Liang Syracuse UniversityPaper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    Solving systems of quadratic equations is a central problem in machine learning and signal processing. One important example is phase retrieval, which aims to recover a signal from only magnitudes of its linear measurements. This paper focuses on the situation when the measurements are corrupted by arbitrary outliers, for which the recently developed non-convex gradient descent Wirtinger flow (WF) and truncated Wirtinger flow (TWF) algorithms likely fail. We develop a novel median-TWF algorithm that exploits robustness of sample median to resist arbitrary outliers in the initialization and the gradient update in each iteration. We show that such a non-convex algorithm provably recovers the signal from a near-optimal number of measurements composed of i.i.d. Gaussian entries, up to a logarithmic factor, even when a constant portion of the measurements are corrupted by arbitrary outliers. We further show that median-TWF is also robust when measurements are corrupted by both arbitrary outliers and bounded noise. Our analysis of performance guarantee is accomplished by development of non-trivial concentration measures of median-related quantities, which may be of independent interest. We further provide numerical experiments to demonstrate the effectiveness of the approach.
  • 11:57 – Estimating Structured Vector Autoregressive Models Igor Melnyk University of Minnesota, Arindam Banerjee Paper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    While considerable advances have been made in estimating high-dimensional structured models from independent data using Lasso-type models, limited progress has been made for settings when the samples are dependent. We consider estimating structured VAR (vector auto-regressive model), where the structure can be captured by any suitable norm, e.g., Lasso, group Lasso, order weighted Lasso, etc. In VAR setting with correlated noise, although there is strong dependence over time and covariates, we establish bounds on the non-asymptotic estimation error of structured VAR parameters. The estimation error is of the same order as that of the corresponding Lasso-type estimator with independent samples, and the analysis holds for any norm. Our analysis relies on results in generic chaining, sub-exponential martingales, and spectral representation of VAR models. Experimental results on synthetic and real data with a variety of structures are presented, validating theoretical results.
  • 12:14 – Towards Faster Rates and Oracle Property for Low-Rank Matrix Estimation Huan Gui University of Illinois at Urba, Jiawei Han university of illinois at urbana-champaign, Quanquan Gu Paper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    We present a unified framework for low-rank matrix estimation with a nonconvex penalty.
    A proximal gradient homotopy algorithm is proposed to solve the proposed optimization problem.
    Theoretically, we first prove that the proposed estimator attains a faster statistical rate than the traditional low-rank matrix estimator with nuclear norm penalty.
    Moreover, we rigorously show that under a certain condition on the magnitude of the nonzero singular values, the proposed estimator enjoys oracle property (i.e., exactly recovers the true rank of the matrix), besides attaining a faster rate.
    Extensive numerical experiments on both synthetic and real world datasets corroborate our theoretical findings.
  • Tuesday – Approximate Inference

    Session chair: Jon Mcauliffe

    Location: Liberty
  • 10:30 – Hierarchical Variational Models Rajesh Ranganath , Dustin Tran Columbia University, Blei David ColumbiaPaper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    Black box variational inference allows researchers to easily prototype and evaluate an array of models. Recent advances allow such algorithms to scale to high dimensions. However, a central question remains: How to specify an expressive variational distribution that maintains efficient computation? To address this, we develop hierarchical variational models (HVMs). HVMs augment a variational approximation with a prior on its parameters, which allows it to capture complex structure for both discrete and continuous latent variables. The algorithm we develop is black box, can be used for any HVM, and has the same computational efficiency as the original approximation. We study HVMs on a variety of deep discrete latent variable models. HVMs generalize other expressive variational distributions and maintains higher fidelity to the posterior.
  • 10:47 – A Variational Analysis of Stochastic Gradient Algorithms Stephan Mandt Columbia University, Matthew Hoffman Adobe Research, Blei David ColumbiaPaper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    Stochastic Gradient Descent (SGD) is an important algorithm in machine learning. With constant learning rates, it is a stochastic process that, after an initial phase of convergence, generates samples from a stationary distribution. We show that SGD with constant rates can be effectively used as an approximate posterior inference algorithm for probabilistic modeling. Specifically, we show how to adjust the tuning parameters of SGD such as to match the resulting stationary distribution to the posterior. This analysis rests on interpreting SGD as a continuous-time stochastic process and then minimizing the Kullback-Leibler divergence between its stationary distribution and the target posterior. (This is in the spirit of variational inference.) In more detail, we model SGD as a multivariate Ornstein-Uhlenbeck process and then use properties of this process to derive the optimal parameters. This theoretical framework also connects SGD to modern scalable inference algorithms; we analyze the recently proposed stochastic gradient Fisher scoring under this perspective. We demonstrate that SGD with properly chosen constant rates gives a new way to optimize hyperparameters in probabilistic models.
  • 11:04 – Black-Box Alpha Divergence Minimization Jose miguel Hernandez-Lobato , Yingzhen Li University of Cambridge, Mark Rowland University of Cambridge, Thang Bui University of Cambridge, Daniel Hernandez-Lobato , Richard Turner University of CambridgePaper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    Black-box alpha (BB-$\alpha$) is a new approximate inference method based on the minimization of $\alpha$-divergences. BB-$\alpha$ scales to large datasets because it can be implemented using stochastic gradient descent. BB-$\alpha$ can be applied to complex probabilistic models with little effort since it only requires as input the likelihood function and its gradients. These gradients can be easily obtained using automatic differentiation. By changing the divergence parameter $\alpha$, the method is able to interpolate between variational Bayes (VB) ($\alpha \rightarrow 0$) and an algorithm similar to expectation propagation (EP) ($\alpha = 1$). Experiments on probit regression and neural network regression and classification problems show that BB-$\alpha$ with non-standard settings of $\alpha$, such as $\alpha = 0.5$, usually produces better predictions than with $\alpha \rightarrow 0$ (VB) or $\alpha = 1$ (EP).
  • 11:40 – Variational Inference for Monte Carlo Objectives Andriy Mnih , Danilo Rezende Google DeepMindPaper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    Recent progress in deep latent variable models has largely been driven by the development of flexible and scalable variational inference methods. Variational training of this type involves maximizing a lower bound on the log-likelihood, using samples from the variational posterior to compute the required gradients. Recently, Burda et al. (2016) have derived a tighter lower bound using a multi-sample importance sampling estimate of the likelihood and showed that optimizing it yields models that use more of their capacity and achieve higher likelihoods. This development showed the importance of such multi-sample objectives and explained the success of several related approaches.
    We extend the multi-sample approach to discrete latent variables and analyze the difficulty encountered when estimating the gradients involved. We then develop the first unbiased gradient estimator designed for importance-sampled objectives and evaluate it at training generative and structured output prediction models. The resulting estimator, which is based on low-variance per-sample learning signals, is both simpler and more effective than the NVIL estimator proposed for the single-sample variational objective, and is competitive with the currently used biased estimators.
  • 11:57 – Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learning Yarin Gal University of Cambridge, Zoubin Paper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    Deep learning tools have gained tremendous attention in applied machine learning. However such tools for regression and classification do not capture model uncertainty. In comparison, Bayesian models offer a mathematically grounded framework to reason about model uncertainty, but usually come with a prohibitive computational cost. In this paper we develop a new theoretical framework casting dropout training in deep neural networks (NNs) as approximate Bayesian inference in deep Gaussian processes. A direct result of this theory gives us tools to model uncertainty with dropout NNs — extracting information from existing models that has been thrown away so far. This mitigates the problem of representing uncertainty in deep learning without sacrificing either computational complexity or test accuracy. We perform an extensive study of the properties of dropout’s uncertainty. Various network architectures and non-linearities are assessed on tasks of regression and classification, using MNIST as an example. We show a considerable improvement in predictive log-likelihood and RMSE compared to existing state-of-the-art methods, and finish by using dropout’s uncertainty in deep reinforcement learning.
  • 12:14 – Auxiliary Deep Generative Models Lars Maaløe Technical University Denmark, Casper Kaae Sønderby University of Copenhagen, Søren Kaae Sønderby University of Copenagen, Ole Winther Technical University of DenmarkPaper | Reviews | Rebuttal | Poster session on monday afternoon 3:00pm-7:00pm | Abstract
    Deep generative models parameterized by neural networks have recently achieved state-of-the-art performance in unsupervised and semi-supervised learning. We extend deep generative models with auxiliary variables which improves the variational approximation. The auxiliary variables leave the generative model unchanged but make the variational distribution more expressive. Inspired by the structure of the auxiliary variable we also propose a model with two stochastic layers and skip connections. Our findings suggest that more expressive and properly specified deep generative models converge faster with better results. We show state-of-the-art performance within semi-supervised learning on MNIST, SVHN and NORB datasets.
  • Tuesday – Neural Networks and Deep Learning I

    Session chair: Nicolas Le Roux

    Location: Ballroom 1+2+Juliard
  • 03:40 – Factored Temporal Sigmoid Belief Networks for Sequence Learning Jiaming Song Tsinghua University, Zhe Gan Duke University, Lawrence Carin Paper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    Deep conditional generative models are developed to simultaneously learn the temporal dependencies of multiple sequences. The model is designed by introducing a three-way weight tensor to capture the multiplicative interactions between side information and sequences. The proposed model builds on the Temporal Sigmoid Belief Network (TSBN), a sequential stack of Sigmoid Belief Networks (SBNs). The transition matrices are further factored to reduce the number of parameters and improve generalization. When side information is not available, a general framework for semi-supervised learning based on the proposed model is constituted, allowing robust sequence classification. Experimental results show that the proposed approach achieves state-of-the-art predictive and classification performance on sequential data, and has the capacity to synthesize sequences, with controlled style transitioning and blending.
  • 03:57 – Bidirectional Helmholtz Machines Jorg Bornschein University of Montreal, Samira Shabanian University of Montreal, Asja Fischer , Yoshua Bengio U. of MontrealPaper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    Efficient unsupervised training and inference in deep generative models remains a challenging problem. One basic approach, called Helmholtz machine or Variational Autoencoder, involves training a top-down directed generative model together with a bottom-up auxiliary model used for approximate inference. Recent results indicate that better generative models can be obtained with better approximate inference procedures. Instead of improving the inference procedure, we here propose a new model, the bidirectional Helmholtz machine, which guarantees that the top-down and bottom-up distributions can efficiently invert each other. We achieve this by interpreting both the top-down and the bottom-up directed models as approximate inference distributions and by defining the model distribution to be the geometric mean of these two. We present a lower-bound for the likelihood of this model and we show that optimizing this bound regularizes the model so that the Bhattacharyya distance between the bottom-up and top-down approximate distributions is minimized. This approach results in state of the art generative models which prefer significantly deeper architectures while it allows for orders of magnitude more efficient likelihood estimation.
  • 04:14 – Structured and Efficient Variational Deep Learning with Matrix Gaussian Posteriors Christos Louizos University of Amsterdam, Max Welling University of Amsterdam / CIFARPaper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    We introduce a variational Bayesian neural network where the parameters are governed via a probability distribution on random matrices. Specifically, we employ a matrix variate Gaussian~\cite{gupta1999matrix} parameter posterior distribution where we explicitly model the covariance among the input and output dimensions of each layer. Furthermore, with approximate covariance matrices we can achieve a more efficient way to represent those correlations that is also cheaper than fully factorized parameter posteriors. We further show that with the “local reprarametrization trick”~\cite{kingma2015variational} on this posterior distribution we arrive at a Gaussian Process~\cite{rasmussen2006gaussian} interpretation of the hidden units in each layer and we, similarly with~\cite{gal2015dropout}, provide connections with deep Gaussian processes. We continue in taking advantage of this duality and incorporate “pseudo-data”~\cite{snelson2005sparse} in our model, which in turn allows for more efficient posterior sampling while maintaining the properties of the original model. The validity of the proposed approach is verified through extensive experiments.
  • 04:31 – Dropout distillation Samuel Rota Bulò FBK, Lorenzo Porzi FBK, Peter Kontschieder Microsoft Research CambridgePaper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    Dropout is a popular stochastic regularization technique for deep neural networks that works by randomly dropping (i.e. zeroing) units from the network during training. This randomization process allows to implicitly train an ensemble of exponentially many networks sharing the same parametrization, which should be averaged at test time to deliver the final prediction. A typical workaround for this intractable averaging operation consists in scaling the layers undergoing dropout randomization. This simple rule called ‘standard dropout’ is efficient, but might degrade the accuracy of the prediction. In this work we introduce a novel approach, coined ‘dropout distillation’, that allows us to train a predictor in a way to better approximate the intractable, but preferable, averaging process, while keeping under control its computational efficiency. We are thus able to construct models that are as efficient as standard dropout, or even more efficient, while being more accurate. Experiments on standard benchmark datasets demonstrate the validity of our method, yielding consistent improvements over conventional dropout.
  • Session chair: Yoshua Bengio

    Location: Ballroom 1+2+Juliard
  • 05:10 – Expressiveness of Rectifier Networks Xingyuan Pan University of Utah, Vivek Srikumar University of UtahPaper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    Rectified Linear Units (ReLUs) have been shown to ameliorate the vanishing gradient problem, allow for efficient backpropagation, and empirically promote sparsity in the learned parameters. They have led to state-of-the-art results in a variety of applications. However, unlike threshold and sigmoid networks, ReLU networks are less explored from the perspective of their expressiveness. This paper studies the expressiveness of ReLU networks. We characterize the decision boundary of two-layer ReLU networks by constructing functionally equivalent threshold networks. We show that while the decision boundary of a two-layer ReLU network can be captured by a threshold network, the latter may require an exponentially larger number of hidden units. We also formulate sufficient conditions for a corresponding logarithmic reduction in the number of hidden units to represent a sign network as a ReLU network. Finally, we experimentally compare threshold networks and their much smaller ReLU counterparts with respect to their ability to learn from synthetically generated data.
  • 05:27 – Convolutional Rectifier Networks as Generalized Tensor Decompositions Nadav Cohen Hebrew University of Jerusalem, Amnon Shashua MobileyePaper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    Convolutional rectifier networks, i.e. convolutional neural networks with rectified linear activation and max or average pooling, are the cornerstone of modern deep learning. However, despite their wide use and success, our theoretical understanding of the expressive properties that drive these networks is partial at best. On the other hand, we have a much firmer grasp of these issues in the world of arithmetic circuits. Specifically, it is known that convolutional arithmetic circuits possess the property of “complete depth efficiency”, meaning that besides a negligible set, all functions realizable by a deep network of polynomial size, require exponential size in order to be realized (or approximated) by a shallow network. In this paper we describe a construction based on generalized tensor decompositions, that transforms convolutional arithmetic circuits into convolutional rectifier networks. We then use mathematical tools available from the world of arithmetic circuits to prove new results. First, we show that convolutional rectifier networks are universal with max pooling but not with average pooling. Second, and more importantly, we show that depth efficiency is weaker with convolutional rectifier networks than it is with convolutional arithmetic circuits. This leads us to believe that developing effective methods for training convolutional arithmetic circuits, thereby fulfilling their expressive potential, may give rise to a deep learning architecture that is provably superior to convolutional rectifier networks but has so far been overlooked by practitioners.
  • 05:44 – Fixed Point Quantization of Deep Convolutional Networks Darryl Lin Qualcomm Research, Sachin Talathi Qualcomm Research, Sreekanth Annapureddy NetraDyne Inc.Paper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    In recent years increasingly complex architectures for deep convolution networks (DCNs) have been proposed to boost the performance on image recognition tasks. However, the gains in performance have come at a cost of substantial increase in computation and model storage resources. Fixed point implementation of DCNs has the potential to alleviate some of these complexities and facilitate potential deployment on embedded hardware. In this paper, we propose a quantizer design for fixed point implementation of DCNs. We formulate and solve an optimization problem to identify optimal fixed point bit-width allocation across DCN layers. Our experiments show that in comparison to equal bit-width settings, the fixed point DCNs with optimized bit width allocation offer >20% reduction in the model size without any loss in accuracy on CIFAR-10 benchmark. We also demonstrate that fine-tuning can further enhance the accuracy of fixed point DCNs beyond that of the original floating point model. In doing so, we report a new state-of-the-art fixed point performance of 6.78% error-rate on CIFAR-10 benchmark.
  • 06:01 – CryptoNets: Applying Neural Networks to Encrypted Data with High Throughput and Accuracy Ran Gilad-Bachrach Microsoft Research, Nathan Dowlin Princeton, Kim Laine Microsoft Research, Kristin Lauter Microsoft Research, Michael Naehrig Microsoft Research, John Wernsing Microsoft ResearchPaper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    Applying machine learning to a problem which involves medical, financial, or other types of sensitive data, not only requires accurate predictions but also careful attention to maintaining data privacy and security. Legal and ethical requirements may prevent the use of cloud-based machine learning solutions for such tasks. In this work, we will present a method to convert learned neural networks to CryptoNets, neural networks that can be applied to encrypted data. This allows a data owner to send their data in an encrypted form to a cloud service that hosts the network. The encryption ensures that the data remains confidential since the cloud does not have access to the keys needed to decrypt it. Nevertheless, we will show that the cloud service is capable of applying the neural network to the encrypted data to make encrypted predictions, and also return them in encrypted form. These encrypted predictions can be sent back to the owner of the secret key who can decrypt them. Therefore, the cloud service does not gain any information about the raw data nor about the prediction it made. We demonstrate CryptoNets on the MNIST optical character recognition tasks. CryptoNets achieve 99% accuracy and can make around 59000 predictions per hour on a single PC. Therefore, they allow high throughput, accurate, and private predictions.
  • Tuesday – Neural Networks and Deep Learning II

    Session chair: Alexandru Niculescu-Mizil

    Location: Ballroom 3+4
  • 03:40 – Revisiting Semi-Supervised Learning with Graph Embeddings Zhilin Yang Carnegie Mellon University, William Cohen CMU, Ruslan Salakhudinov U. of TorontoPaper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    We present a semi-supervised learning framework based on graph embeddings. Given a graph between instances, we train an embedding for each instance to jointly predict the class label and the neighborhood context in the graph. We develop both transductive and inductive variants of our method. In the transductive variant of our method, the class labels are determined by both the learned embeddings and input feature vectors, while in the inductive variant, the embeddings are defined as a parametric function of the feature vectors, so predictions can be made on instances not seen during training. On a large and diverse set of benchmark tasks, including text classification, distantly supervised entity extraction, and entity classification, we show improved performance over many of the existing models.
  • 03:57 – ADIOS: Architectures Deep In Output Space Moustapha Cisse , Maruan Al-Shedivat CMU, Samy Bengio GooglePaper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    Multi-label classification is a generalization of binary classification where the task consists in predicting \emph{sets of labels}. With the availability of ever larger datasets, the multi-label setting has become a natural one in many applications, and the interest in solving multi-label problems has grown significantly. As expected, deep learning approaches are now yielding state-of-the-art performance for this class of problems.
    Unfortunately, they usually do not take into account the often unknown but nevertheless rich relationships between labels. In this paper, we propose to make use of this underlying structure by learning to partition the labels into a Markov Blanket Chain and then applying a novel deep architecture that exploits the partition.
    Experiments on several popular and large multi-label datasets demonstrate that our approach not only yields significant improvements, but also helps to overcome trade-offs specific to the multi-label classification setting.
  • 04:14 – Unsupervised Deep Embedding for Clustering Analysis Junyuan Xie University of Washington, Ross Girshick Facebook, Ali Farhadi University of WashingtonPaper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    Clustering is central to many data-driven application domains and has been studied extensively in terms of distance functions and grouping algorithms.
    Relatively little work has focused on learning representations for clustering.
    In this paper, we propose Deep Embedded Clustering (DEC), a method that simultaneously learns feature representations and cluster assignments using deep neural networks.
    DEC learns a mapping from the data space to a lower-dimensional feature space in which it iteratively optimizes a clustering objective.
    Our experimental evaluations on image and text corpora show significant improvement over state-of-the-art methods.
  • 04:31 – Learning Convolutional Neural Networks for Graphs Mathias Niepert NEC Laboratories Europe, Mohamed Ahmed NEC Laboratories Europe, Konstantin Kutzkov NEC Laboratories EuropePaper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    Numerous important problems can be framed as learning from graph data.
    We propose a framework for learning convolutional neural networks for arbitrary graphs. These graphs may be undirected, directed, and with both discrete and continuous node and edge attributes. Analogous to image-based convolutional networks that operate on locally connected regions of the input, we present a general approach to extracting locally connected regions from graphs. Using established benchmark data sets, we demonstrate that the learned feature representations are competitive with state of the art graph kernels and that their computation is highly efficient.
  • Session chair: David Sontag

    Location: Ballroom 3+4
  • 05:10 – Correcting Forecasts with Multifactor Neural Attention Matthew Riemer IBM, Aditya Vempaty IBM, Flavio Calmon IBM, Fenno Heath IBM, Richard Hull IBM, Elham Khabiri IBMPaper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    Automatic forecasting of time series data is a challenging problem in many industries. Current forecast models adopted by businesses do not provide adequate means for including data representing external factors that may have a significant impact on the time series, such as weather, national events, local events, social media trends, promotions, etc. This paper introduces a novel neural network attention mechanism that naturally incorporates data from multiple external sources without the feature engineering needed to get other techniques to work. We demonstrate empirically that the proposed model achieves superior performance for predicting the demand of 20 commodities across 107 stores of one of America’s largest retailers when compared to other baseline models, including neural networks, linear models, certain kernel methods, Bayesian regression, and decision trees. Our method ultimately accounts for a 23.9% relative improvement as a result of the incorporation of external data sources, and provides an unprecedented level of descriptive ability for a neural network forecasting model.
  • 05:27 – Meta-Learning with Memory-Augmented Neural Networks Adam Santoro Google DeepMind, Sergey Bartunov Higher School of Economics, Matthew Botvinick , Daan Wierstra Google DeepMind, Timothy Lillicrap Google DeepMindPaper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    Despite recent breakthroughs in the applications of deep neural networks, one setting that presents a persistent challenge is that of “one-shot learning.” Traditional gradient-based networks require a lot of data to learn, often through extensive iterative training. When new data is encountered, the models must inefficiently relearn their parameters to adequately incorporate the new information without catastrophic interference. Architectures with augmented memory capacities, such as Neural Turing Machines (NTMs), offer the ability to quickly encode and retrieve new information, and hence can potentially obviate the downsides of conventional models. Here, we demonstrate the ability of a memory-augmented neural network to rapidly assimilate new data, and leverage this data to make accurate predictions after only a few samples. We also introduce a new method for accessing an external memory that focuses on memory content, unlike previous methods that additionally use memory location-based focusing mechanisms.
  • 05:44 – Learning Simple Algorithms from Examples Wojciech Zaremba , Tomas , Armand Joulin , Rob Fergus Facebook AI ResearchPaper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    We present an approach for learning simple algorithms such as copying, multi-digit addition and single digit multiplication directly from examples. Our framework consists of a set of interfaces, accessed by a controller. Typical interfaces are 1-D tapes or 2-D grids that hold the input and output data. For the controller, we explore a range of neural network-based models which vary in their ability to abstract the underlying algorithm from training instances and generalize to test examples with many thousands of digits. The controller is trained using Q-learning with several enhancements and we show that the bottleneck is in the capabilities of the controller rather than in the search incurred by Q-learning.
  • 06:01 – Associative Long Short-Term Memory Ivo Danihelka Google DeepMind, Greg Wayne Google DeepMind, Benigno Uria Google DeepMind, Nal Kalchbrenner Google Deepmind, Alex Graves Google DeepMindPaper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    We investigate a new method to augment recurrent neural networks with extra memory without increasing the number of network parameters.
    The system has an associative memory based on complex-valued vectors and is closely related to Holographic Reduced Representations and Long Short-Term Memory networks. Holographic Reduced Representations have limited capacity: as they store more information, each retrieval becomes noisier due to interference.
    Our system in contrast creates redundant copies of stored information, which enables retrieval with reduced noise.
    Experiments demonstrate faster learning on multiple memorization tasks.
  • Tuesday – Optimization (Continuous)

    Session chair: Le Song

    Location: Lyceum
  • 03:40 – On the Statistical Limits of Convex Relaxations Zhaoran Wang Princeton University, Quanquan Gu , Han Paper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    Many high dimensional sparse learning problems are formulated as nonconvex optimization. A popular approach to solve these nonconvex optimization problems is through convex relaxations such as linear and semidefinite programming. In this paper, we study the statistical limits of convex relaxations. Particularly, we consider two problems: Mean estimation for sparse principal submatrix and edge probability estimation for stochastic block model. We exploit the sum-of-squares relaxation hierarchy to sharply characterize the limits of a broad class of convex relaxations. Our result shows statistical optimality needs to be compromised for achieving computational tractability using convex relaxations. Compared with existing results on computational lower bounds for statistical problems, which consider general polynomial-time algorithms and rely on computational hardness hypotheses on problems like planted clique detection, our theory focuses on a broad class of convex relaxations and does not rely on unproven hypotheses.
  • 03:57 – Faster Convex Optimization: Simulated Annealing with an Efficient Universal Barrier Jacob Abernethy U. of Michigan, Elad Hazan Princeton UniversityPaper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    This paper explores a surprising equivalence between two seemingly-distinct convex optimization methods. We show that simulated annealing, a well-studied random walk algorithms, is *directly equivalent*, in a certain sense, to the central path interior point algorithm for the the entropic universal barrier function. This connection exhibits several benefits. First, we are able improve the state of the art time complexity for convex optimization under the membership oracle model by devising a new temperature schedule for simulated annealing motivated by central path following interior point methods.
    Second, we get an efficient randomized interior point method with an efficiently computable universal barrier for any convex set described by a membership oracle. Previously, efficiently computable barriers were known only for particular convex sets.
  • 04:14 – A ranking approach to global optimization Cedric Malherbe ENS Cachan, Emile Contal ENS Cachan, Nicolas Vayatis ENS CachanPaper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    We consider the problem of maximizing an unknown function f over a compact and convex set using as few observations f(x) as possible. We observe that the optimization of the function f essentially relies on learning the induced bipartite ranking rule of f. Based on this idea, we relate global optimization to bipartite ranking which allows to address problems with high dimensional input space, as well as cases of functions with weak regularity properties. The paper introduces novel meta-algorithms for global optimization which rely on the choice of any bipartite ranking method. Theoretical properties are provided as well as convergence guarantees and equivalences between various optimization methods are obtained as a by-product. Eventually, numerical evidence is given to show that the main algorithm of the paper which adapts empirically to the underlying ranking structure essentially outperforms existing state-of-the-art global optimization algorithms in typical benchmarks.
  • 04:31 – Epigraph projections for fast general convex programming Po-Wei Wang Carnegie Mellon University, Matt Wytock , Zico Paper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    This paper develops an approach for efficiently solving general convex optimization problems specified as disciplined convex programs (DCP), a common general-purpose modeling framework. Specifically we develop an algorithm based upon fast epigraph projections, projections onto the epigraph of a convex function, an approach closely linked to proximal operator methods. We show that by using these operators, we can solve any disciplined convex program without transforming the problem to a standard cone form, as is done by current DCP libraries. We then develop a large library of efficient epigraph projection operators, mirroring and extending work on fast proximal algorithms, for many common convex functions. Finally, we evaluate the performance of the algorithm, and show it often achieves order of magnitude speedups over existing general-purpose optimization solvers.
  • Session chair: Tong Zhang

    Location: Lyceum
  • 05:10 – Low-rank Solutions of Linear Matrix Equations via Procrustes Flow Stephen Tu UC Berkeley, Ross Boczar UC Berkeley, Max Simchowitz UC Berkeley, mahdi Soltanolkotabi , Ben Recht BerkeleyPaper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    In this paper we study the problem of recovering a low-rank matrix from linear measurements. Our algorithm, which we call Procrustes Flow, starts from an initial estimate obtained by a thresholding scheme followed by gradient descent on a non-convex objective. We show that as long as the measurements obey a standard restricted isometry property, our algorithm converges to the unknown matrix at a geometric rate. In the case of Gaussian measurements, such convergence occurs for a n1 × n2 matrix of rank r when the number of measurements exceeds a constant times (n1 + n2)r.
  • 05:27 – Quadratic Optimization with Orthogonality Constraints: Explicit Lojasiewicz Exponent and Linear Convergence of Line-Search Methods Huikang Liu CUHK, Weijie Wu CUHK, Anthony Man-Cho So Paper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    A fundamental class of matrix optimization problems that arise in many areas of science and engineering is that of quadratic optimization with orthogonality constraints. Such problems can be solved using line-search methods on the Stiefel manifold, which are known to converge globally under mild conditions. To determine the convergence rates of these methods, we give an explicit estimate of the exponent in a Lojasiewicz inequality for the (non-convex) set of critical points of the aforementioned class of problems. This not only allows us to establish the linear convergence of a large class of line-search methods but also answers an important and intriguing problem in mathematical analysis and numerical optimization. A key step in our proof is to establish a local error bound for the set of critical points, which may be of independent interest.
  • 05:44 – Efficient Algorithms for Large-scale Generalized Eigenvector Computation and Canonical Correlation Analysis Rong Ge , Chi Jin UC Berkeley, Sham , Praneeth Netrapalli Microsoft Research, Aaron Sidford Microsoft Research, New EnglandPaper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    This paper considers the problem of canonical-correlation analysis (CCA) and, more broadly, the generalized eigenvector problem for a pair of symmetric matrices. These are two fundamental problems in data analysis and scientific computing with numerous applications in machine learning and statistics.

    We provide simple iterative algorithms, with improved runtimes, for solving these problems that are globally linearly convergent with moderate dependencies on the condition numbers and eigenvalue gaps of the matrices involved.

    We obtain our results by reducing CCA to the top-$k$ generalized eigenvector problem. We solve this problem through a general framework that simply requires black box access to an approximate linear system solver. Instantiating this framework with accelerated gradient descent we obtain a running time of $\order{\frac{z k \sqrt{\kappa}}{\rho} \log(1/\epsilon) \log \left(k\kappa/\rho\right)}$ where $z$ is the total number of nonzero entries, $\kappa$ is the condition number and $\rho$ is the relative eigenvalue gap of the appropriate matrices.

    Our algorithm is linear in the input size and the number of components $k$ up to a $\log(k)$ factor. This is essential for handling large-scale matrices that appear in practice. To the best of our knowledge this is the first such algorithm with global linear convergence. We hope that our results prompt further research and ultimately improve the practical running time for performing these important data analysis procedures on large data sets.

  • 06:01 – Matrix Eigen-decomposition via Doubly Stochastic Riemannian Optimization Zhiqiang Xu Institute of Infocomm Research, Peilin Zhao I2R, ASTAR, Jianneng Cao , Xiaoli Li Paper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    Matrix eigen-decomposition is a classic and long-standing problem that plays a fundamental role in scientific computing and machine learning. Despite some existing algorithms for this inherently non-convex problem, the study remains inadequate for the need of large data nowadays. To address this gap, we propose a Doubly Stochastic Riemannian Gradient EIGenSolver, DSRG-EIGS, where the double stochasticity comes from the generalization of the stochastic Euclidean gradient ascent and the stochastic Euclidean coordinate ascent to Riemannian manifolds. As a result, it induces a greatly reduced complexity per iteration, enables the algorithm to completely avoid the matrix inversion, and consequently makes it well-suited to large-scale applications. We theoretically analyze its convergence properties and empirically validate it on real-world datasets. Encouraging experimental results demonstrate its advantages over the deterministic counterparts.
  • Tuesday – Matrix Factorization and Related Topics

    Session chair: Roger Grosse

    Location: Empire
  • 03:40 – Principal Component Projection Without Principal Component Analysis Roy Frostig Stanford University, Cameron Musco Massachusetts Institute of Technology, Christopher Musco Mass. Institute of Technology, Aaron Sidford Microsoft Research, New EnglandPaper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    We show how to efficiently project a vector onto the top principal components of a matrix, *without explicitly computing these components*. Specifically, we introduce an iterative algorithm that provably computes the projection using few calls to any black-box routine for ridge regression.

    By avoiding explicit principal component analysis (PCA), our algorithm is the first with no runtime dependence on the number of top principal components. We show that it can be used to give a fast iterative method for the popular principal component regression problem, giving the first major runtime improvement over the naive method of combining PCA with regression.

    To achieve our results, we first observe that ridge regression can be used to obtain a “smooth projection” onto the top principal components. We then sharpen this approximation to true projection using a low-degree polynomial approximation to the matrix step function. Step function approximation is a topic of long-term interest in scientific computing. We extend prior theory by constructing polynomials with simple iterative structure and rigorously analyzing their behavior under limited precision.

  • 03:57 – Recovery guarantee of weighted low-rank approximation via alternating minimization Yuanzhi Li Princeton University, Yingyu Liang Princeton, Andrej Risteski Princeton UniversityPaper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    Many applications require recovering a ground truth low-rank matrix from noisy observations of the entries, which in practice is typically formulated as a weighted low-rank approximation problem and solved by non-convex optimization heuristics such as alternating minimization.
    In this paper, we provide provable recovery guarantee of weighted low-rank via a simple alternating minimization algorithm. In particular, for a natural class of matrices and weights and without any assumption on the noise, we bound the spectral norm of the difference between the recovered matrix and the ground truth, by the spectral norm of the weighted noise plus an additive error term that decreases exponentially with the number of rounds of alternating minimization, from either initialization by SVD or, more importantly, random initialization.
    These provide the first theoretical results for weighted low-rank approximation via alternating minimization with non-binary deterministic weights, significantly generalizing those for matrix completion, the special case with binary weights, since our assumptions are similar or weaker than those made in existing works. Furthermore, this is achieved by a very simple algorithm that improves the vanilla alternating minimization with a simple clipping step.
  • 04:14 – Tensor Decomposition via Joint Matrix Schur Decomposition Nicolo Colombo Univ of Luxembourg, Nikos Vlassis AdobePaper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    We describe an approach to tensor decomposition that involves extracting a set of observable matrices from the tensor and applying an approximate joint Schur decomposition on those matrices, and we establish the corresponding first-order perturbation bounds. We develop a novel iterative Gauss-Newton algorithm for joint matrix Schur decomposition, which minimizes a nonconvex objective over the manifold of orthogonal matrices, and which is guaranteed to converge to a global optimum under certain conditions. We empirically demonstrate that our algorithm is faster and at least as accurate and robust than state-of-the-art algorithms for this problem.
  • 04:31 – Fast methods for estimating the Numerical rank of large matrices Shashanka Ubaru University of Minnesota, Yousef Saad University of MinnesotaPaper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    We present two computationally inexpensive techniques for estimating the numerical rank of a matrix, combining powerful tools from computational linear algebra. These techniques exploit three key ingredients. The first is to approximate the projector on the non-null invariant subspace of the matrix by using a polynomial filter. Two types of filters are discussed, one based on Hermite interpolation and the other based on Chebyshev expansions. The second ingredient employs stochastic trace estimators to compute the rank of this wanted eigen-projector, which yields the desired rank of the matrix. In order to obtain a good filter, it is necessary to detect a gap between the eigenvalues that correspond to noise and the relevant eigenvalues that correspond to the non-null invariant subspace. The third ingredient of the proposed approaches exploits the idea of spectral density, popular in physics, and the Lanczos spectroscopic method to locate this gap.
  • Tuesday – Unsupervised Learning / Applications

    Session chair: Jeff Bilmes

    Location: Soho
  • 03:40 – Markov-modulated Marked Poisson Processes for Check-in Data Jiangwei Pan Duke University, Vinayak Rao Purdue University, Pankaj Agarwal Duke Univeristy, Alan Gelfand Duke UniversityPaper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    We develop continuous-time probabilistic models to study trajectory data consisting of times and locations of user ‘check-ins’. We model the data as realizations of a marked point process, with intensity and mark-distribution modulated by a latent Markov jump process (MJP). We also include user-heterogeneity in our model by assigning each user a vector of ‘preferred locations’. Our model extends latent Dirichlet allocation by dropping the bag-of-words assumption and operating in continuous time. We show how an appropriate choice of priors allows efficient posterior inference. Our experiments demonstrate the usefulness of our approach by comparing with various baselines on a variety of tasks.
  • 03:57 – Hierarchical Compound Poisson Factorization Mehmet Basbug Princeton University, Barbara Engelhardt Paper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    Non-negative matrix factorization models based on a hierarchical Gamma-Poisson structure capture user and item behavior effectively in extremely sparse data sets, making them the ideal choice for collaborative filtering applications. Hierarchical Poisson factorization (HPF) in particular has proved successful for scalable recommendation systems with extreme sparsity. HPF, however, suffers from a tight coupling of sparsity model (absence of a rating) and response model (the value of the rating), which limits the expressiveness of the latter. Here, we introduce hierarchical compound Poisson factorization (HCPF) that has the favorable Gamma-Poisson structure and scalability of HPF to high-dimensional extremely sparse matrices. More importantly, HCPF decouples the sparsity model from the response model, allowing us to choose the most suitable distribution for the response. HCPF can capture binary, non-negative discrete, non-negative continuous, and zero-inflated continuous responses. We compare HCPF with HPF on nine discrete and three continuous data sets and conclude that HCPF captures the relationship between sparsity and response better than HPF.
  • 04:14 – Dirichlet Process Mixture Model for Correcting Technical Variation in Single-Cell Gene Expression Data Sandhya Prabhakaran Columbia University, Elham Azizi Columbia University, Ambrose Carr Columbia University, Dana Pe’er Columbia UniversityPaper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    We introduce an iterative normalization and clustering method for single-cell gene expression data. The emerging technology of single-cell RNA-seq gives access to gene expression measurements for thousands of cells, allowing discovery and characterization of cell types. However, the data is confounded by technical variation emanating from experimental errors and cell type-specific biases. Current approaches perform a global normalization prior to analyzing biological signals, which does not resolve missing data or variation dependent on latent cell types.
    Our model is formulated as a hierarchical Bayesian mixture model with cell-specific scalings that aid the iterative normalization and clustering of cells, teasing apart technical variation from biological signals. We demonstrate that this approach is superior to global normalization followed by clustering. We show identifiability and weak convergence guarantees of our method and present a scalable Gibbs inference algorithm. This method improves cluster inference in both synthetic and real single-cell data compared with previous methods, and allows easy interpretation and recovery of the underlying structure and cell types.
  • 04:31 – Automatic Construction of Nonparametric Relational Regression Models for Multiple Time Series Yunseong Hwang UNIST, Anh Tong UNIST, Jaesik Choi UNISTPaper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    Gaussian Processes (GPs) provide a general and analytically tractable way of modeling complex time-varying, nonparametric functions. The Automatic Bayesian Covariance Discovery (ABCD) system constructs natural-language description of time-series data by treating unknown time-series data nonparametrically using GP with a composite covariance kernel function. Unfortunately, learning a composite covariance kernel with a single time-series data set often results in less informative kernel that may not give qualitative, distinctive descriptions of data. We address this challenge by proposing two relational kernel learning methods which can model multiple time-series data sets by finding common, shared causes of changes. We show that the relational kernel learning methods find more accurate models for regression problems on several real-world data sets; US stock data, US house price index data and currency exchange rate data.
  • Tuesday – Learning Theory

    Session chair: Jon Mcauliffe

    Location: Liberty
  • 03:40 – Truthful Univariate Estimators Ioannis Caragiannis University of Patras, Ariel Procaccia Carnegie Mellon University, Nisarg Shah Carnegie Mellon UniversityPaper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    We revisit the classic problem of estimating the population mean of an unknown single-dimensional distribution from samples, taking a game-theoretic viewpoint. In our setting, samples are supplied by strategic agents, who wish to pull the estimate as close as possible to their own value. In this setting, the sample mean gives rise to manipulation opportunities, whereas the sample median does not. Our key question is whether the sample median is the best (in terms of mean squared error) truthful estimator of the population mean. We show that when the underlying distribution is symmetric, there are truthful estimators that dominate the median. Our main result is a characterization of worst-case optimal truthful estimators, which provably outperform the median, for possibly asymmetric distributions with bounded support.
  • 03:57 – Fast Algorithms for Segmented Regression Jayadev Acharya MIT, Ilias Diakonikolas , Jerry Li MIT, Ludwig Schmidt Paper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    We study the fixed design segmented regression problem: Given noisy samples from a piecewise linear function f, we want to recover f up to a desired accuracy in mean-squared error.

    Previous rigorous approaches for this problem rely on dynamic programming (DP) and, while sample efficient, have running time quadratic in the sample size. As our main contribution, we provide new sample near-linear time algorithms for the problem that – while not being minimax optimal – achieve a significantly better sample-time tradeoff on large datasets compared to the DP approach. Our experimental evaluation shows that, compared with the DP approach, our algorithms provide a convergence rate that is only off by a factor of 2 to 4, while achieving speedups of three orders of magnitude.

  • 04:14 – Stochastically Transitive Models for Pairwise Comparisons: Statistical and Computational Issues Nihar Shah UC Berkeley, Sivaraman Balakrishnan CMU, Aditya Guntuboyina UC Berkeley, Martin Wainwright UC BerkeleyPaper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    There are various parametric models for analyzing pairwise comparison data, including the Bradley-Terry-Luce (BTL) and Thurstone models, but their reliance on strong parametric assumptions is limiting. In this work, we study a flexible model for pairwise comparisons, under which the probabilities of outcomes are required only to satisfy a natural form of stochastic transitivity. This class includes parametric models including the BTL and Thurstone models as special cases, but is considerably more general. We provide various examples of models in this broader stochastically transitive class for which classical parametric models provide poor fits. Despite this greater flexibility, we show that the matrix of probabilities can be estimated at the same rate as in standard parametric models. On the other hand, unlike in the BTL and Thurstone models, computing the minimax-optimal estimator in the stochastically transitive model is non-trivial, and we explore various computationally tractable alternatives. We show that a simple singular value thresholding algorithm is statistically consistent but does not achieve the minimax rate. We then propose and study algorithms that achieve the minimax rate over interesting sub-classes of the full stochastically transitive class. We complement our theoretical results with thorough numerical simulations.
  • 04:31 – Provable Algorithms for Inference in Topic Models Sanjeev Arora Princeton University, Rong Ge , Frederic Koehler Princeton University, Tengyu Ma Princeton University, Ankur Moitra Paper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    Recently, there has been considerable progress on designing algorithms with provable guarantees —typically using linear algebraic methods—for parameter learning in latent variable models.
    Designing provable algorithms for inference has proved more difficult. Here we take a first step towards provable inference in topic models. We leverage a property of topic models that enables us to construct simple linear estimators for the unknown topic proportions that have small variance, and consequently can work with short documents. Our estimators also correspond to finding an estimate around which the posterior is well-concentrated. We show lower bounds that for shorter documents it can be information theoretically impossible to find the hidden topics. Finally, we give empirical results that demonstrate that our algorithm works on realistic topic models. It yields good solutions on synthetic data and runs in time comparable to a single iteration of Gibbs sampling.
  • Tuesday – Large Scale Learning and Big Data

    Session chair: Andreas Krause

    Location: Empire
  • 05:10 – Extreme F-measure Maximization using Sparse Probability Estimates Kalina Jasinska , Krzysztof Dembczynski , Robert Busa-Fekete , Karlson Pfannschmidt , Timo Klerx , Eyke Hullermeier Paper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    We consider the problem of (macro) F-measure maximization in the context of extreme multi-label classification (XMLC), i.e., multi-label classification with extremely large label spaces. We investigate several approaches based on recent results on the maximization of complex performance measures in binary classification. According to these results, the F-measure can be maximized by properly thresholding conditional class probability estimates. We show that a naive adaptation of this approach can be very costly for XMLC and propose to solve the problem by classifiers that efficiently deliver sparse probability estimates (SPEs), that is, probability estimates restricted to the most probable labels. Empirical results provide evidence for the strong practical performance of this approach.
  • 05:27 – Stochastic Optimization for Multiview Representation Learning using Partial Least Squares Raman Arora Johns Hopkins University, Poorya Mianjy Johns Hopkins University, Teodor Marinov Paper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    Partial Least Squares (PLS) is a ubiquitous statistical technique for bilinear factor analysis. It is used in many data analysis, machine learning, and information retrieval applications to model the covariance structure between a pair of data matrices. In this paper, we consider PLS for representation learning in a multiview setting where we have more than one view in data at training time. Furthermore, instead of framing PLS as a problem about a fixed given data set, we argue that PLS should be studied as a stochastic optimization problem, especially in a “big data” setting, with the goal of optimizing a population objective based on sample. This view suggests using Stochastic Approximation (SA) approaches, such as Stochastic Gradient Descent (SGD) and enables a rigorous analysis of their benefits. In this paper, we develop SA approaches to PLS and provide iteration complexity bounds for the proposed algorithms.
  • 05:44 – Gaussian quadrature for matrix inverse forms with applications Chengtao Li MIT, Suvrit Sra , Stefanie Jegelka MITPaper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    We present a framework for accelerating a spectrum of machine learning algorithms that require computation of \emph{bilinear inverse forms} $u^\top A^{-1}u$, where $A$ is a positive definite matrix and $u$ a given vector. Our framework is built on Gauss-type quadrature and easily scales to large, sparse matrices. Further, it allows retrospective computation of lower and upper bounds on $u^\top A^{-1}u$, which in turn accelerates several algorithms. We prove that these bounds tighten iteratively and converge at a linear (geometric) rate. To our knowledge, ours is the first work to demonstrate these key properties of Gauss-type quadrature, which is a classical and deeply studied topic. We illustrate empirical consequences of our results by using quadrature to accelerate machine learning tasks involving determinantal point processes and submodular optimization, and observe tremendous speedups in several instances.
  • 06:01 – A Subspace Learning Approach for High Dimensional Matrix Decomposition with Efficient Column/Row Sampling Mostafa Rahmani University of Central Florida, Geroge Atia University of Central FloridaPaper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    This paper presents a new randomized approach to high-dimensional low rank (LR) plus sparse matrix decomposition. For a data matrix $D \in {R}^{N_1 \times N_2}$, the complexity of conventional decomposition methods is $O(N_1 N_2 r)$, which limits their usefulness in big data settings ($r$ is the rank of the LR component). In addition, the existing randomized approaches rely for the most part on uniform random sampling, which may be inefficient for many real world data matrices. The proposed subspace learning based approach recovers the LR component using only a small subset of the columns/rows of data and reduces complexity to $O(\max(N_1,N_2) r^2)$. Even when the columns/rows are sampled uniformly at random, the sufficient number of sampled columns/rows is shown to be roughly $O(r \mu)$, where $\mu$ is the coherency parameter of the LR component. In addition, efficient sampling algorithms are proposed to address the problem of column/row sampling from structured data.
  • Tuesday – Graphical Models

    Session chair: Jun Zhu

    Location: Soho
  • 05:10 – Uprooting and Rerooting Graphical Models Adrian Weller University of CambridgePaper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    We show how any binary pairwise model may be ‘uprooted’ to a fully symmetric model, wherein original singleton potentials are transformed to potentials on edges to an added variable, and then ‘rerooted’ to a new model on the original number of variables. The new model is essentially equivalent to the original model, with the same partition function and allowing recovery of the original marginals or a MAP configuration, yet may have very different computational properties that allow much more efficient inference. This meta-approach deepens our understanding, may be applied to any existing algorithm to yield improved methods in practice, generalizes earlier theoretical results, and reveals a remarkable interpretation of the triplet-consistent polytope.
  • 05:27 – Structure Learning of Partitioned Markov Networks Song Liu The Inst. of Stats. Math., Taiji Suzuki , Masashi Sugiyama University of Tokyo, Kenji Fukumizu The Institute of Statistical MathematicsPaper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    We learn the structure of a Markov Network between two groups of random variables from joint observations. Since modelling and learning the full MN structure may be hard, learning the links between two groups directly may be a preferable option. We introduce a novel concept called the \emph{partitioned ratio} whose factorization directly associates with the Markovian properties of random variables across two groups. A simple one-shot convex optimization procedure is proposed for learning the \emph{sparse} factorizations of the partitioned ratio and it is theoretically guaranteed to recover the correct inter-group structure under mild conditions. The performance of the proposed method is experimentally compared with the state of the art MN structure learning methods using ROC curves. Real applications on analyzing bipartisanship in US congress and pairwise DNA/time-series alignments are also reported.
  • Best paper award – 05:44 – Ensuring Rapid Mixing and Low Bias for Asynchronous Gibbs Sampling Christopher De Sa Stanford, Chris Re Stanford University, Kunle Olukotun StanfordPaper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    Gibbs sampling is a Markov chain Monte Carlo technique commonly used for estimating marginal distributions. To speed up Gibbs sampling, there has recently been interest in parallelizing it by executing asynchronously. While empirical results suggest that many models can be efficiently sampled asynchronously, traditional Markov chain analysis does not apply to the asynchronous case, and thus asynchronous Gibbs sampling is poorly understood. In this paper, we derive a better understanding of the two main challenges of asynchronous Gibbs: bias and mixing time. We show experimentally that our theoretical results match practical outcomes.
  • 06:01 – Estimation from Indirect Supervision with Linear Moments Aditi Raghunathan Stanford University, Roy Frostig Stanford University, John , Percy Liang StanfordPaper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    In structured prediction problems where we have indirect supervision of the
    output, maximum marginal likelihood faces two computational obstacles:
    non-convexity of the objective and intractability of even a single gradient
    computation. In this paper, we bypass both obstacles for a class of what we
    call linear indirectly-supervised problems. Our approach is simple: we
    solve a linear system to estimate sufficient statistics of the model,
    which we then use to estimate parameters via convex optimization. We
    analyze the statistical properties of our approach and show empirically that
    it is effective in two settings: learning with local privacy constraints
    and learning from low-cost count-based annotations.
  • Tuesday – Supervised Learning

    Session chair: Nicolas Le Roux

    Location: Liberty
  • 05:10 – Early and Reliable Event Detection Using Proximity Space Representation Maxime Sangnier LTCI, CNRS, Télécom ParisTech, Jerome Gauthier CEA, Alain Rakotomamonjy Paper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    Let us consider a specific action or situation (called event) that takes place within a time series. The objective in early detection is to build a decision function that is able to go off as soon as possible from the onset of an occurrence of this event. This implies making a decision with an incomplete information. This paper proposes a novel framework that i) guarantees that a detection made with a partial observation will also occur at full observation of the time-series; ii) incorporates in a consistent manner the lack of knowledge about the minimal amount of information needed to make a decision. The proposed detector is based on mapping the temporal sequences to a landmarking space thanks to appropriately designed similarity functions. As a by-product, the framework benefits from a scalable training algorithm and a theoretical guarantee concerning its generalization ability. We also discuss an important improvement of our framework in which decision function can still be made reliable while being more expressive. Our experimental studies provide compelling results on toy data, presenting the trade-off that occurs when aiming at accuracy, earliness and reliability. Results on real physiological and video datasets show that our proposed approach is as accurate and early as state-of-the-art algorithm, while ensuring reliability and being far more efficient to learn.
  • 05:27 – Meta–Gradient Boosted Decision Tree Model for Weight and Target Learning Yury Ustinovskiy Yandex, Valentina Fedorova Yandex, Gleb Gusev Yandex, Pavel Serdyukov YandexPaper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    Labeled training data is an essential part of any supervised machine learning framework. In practice, there is a trade-off between the quality of a label and its cost. In this paper, we consider a problem of learning to rank on a large-scale dataset with low-quality relevance labels aiming at maximizing the quality of a trained ranker on a small validation dataset with high-quality ground truth relevance labels. Motivated by the classical Gauss-Markov theorem for the linear regression problem, we formulate the problems of (1) reweighting training instances and (2) remapping learning targets. We propose meta–gradient decision tree learning framework for optimizing weight and target functions by applying gradient-based hyperparameter optimization. Experiments on a large-scale real-world dataset demonstrate that we can significantly improve state-of-the-art machine-learning algorithms by incorporating our framework.
  • 05:44 – Differential Geometric Regularization for Supervised Learning of Classifiers Qinxun Bai Boston University, Steven Rosenberg Boston University, Zheng Wu The Mathwork Inc., Stan Sclaroff Boston UniversityPaper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    We study the problem of supervised learning for both binary and multiclass classification from a unified geometric perspective. In particular, we propose a geometric regularization technique to find the submanifold corresponding to an estimator of the class probability $P(y|\vec x).$ The regularization term measures the volume of this submanifold, based on the intuition that overfitting produces rapid local oscillations and hence large volume of the estimator. This technique can be applied to regularize any classification function that satisfies two requirements: firstly, an estimator of the class probability can be obtained; secondly, first and second derivatives of the class probability estimator can be calculated. In experiments, we apply our regularization technique to standard loss functions for classification, our RBF-based implementation compares favorably to widely used regularization methods for both binary and multiclass classification.
  • 06:01 – Linking losses for density ratio and class-probability estimation Aditya Menon National ICT Australia, Cheng Soon Ong NICTAPaper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    Given samples from two densities p and q, density ratio estimation (DRE) is the problem of estimating the ratio p/q. Two popular discriminative approaches to DRE are KL importance estimation (KLIEP), and least squares importance fitting (LSIF). In this paper, we show that KLIEP and LSIF both employ class-probability estimation (CPE) losses. Motivated by this, we formally relate DRE and CPE, and demonstrate the viability of using existing losses from one problem for the other. For the DRE problem, we show that essentially any CPE loss (eg logistic, exponential) can be used, as this equivalently minimises a Bregman divergence to the true density ratio. We show how different losses focus on accurately modelling different ranges of the density ratio, and use this to design new CPE losses for DRE. For the CPE problem, we argue that the LSIF loss is useful in the regime where one wishes to rank instances with maximal accuracy at the head of the ranking. In the course of our analysis, we establish a Bregman divergence identity that may be of independent interest.
  • Wednesday – Neural Networks and Deep Learning I

    Session chair: Samy Bengio

    Location: Ballroom 1+2+Juliard
  • 08:30 – Neural Variational Inference for Text Processing Yishu Miao University of Oxford, Lei Yu University of Oxford, Phil Blunsom Paper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    Recent advances in neural variational inference have spawned a renaissance in deep latent variable models. In this paper we introduce a generic variational inference framework for generative and conditional models of text. While traditional variational methods derive an analytic approximation for the intractable distributions over latent variables, here we construct an inference network conditioned on the discrete text input to provide the variational distribution. We validate this framework on two very different text modelling applications, generative document modelling and supervised question answering. Our neural variational document model combines a continuous stochastic document representation with a bag-of-words generative model and achieves the lowest reported perplexities on two standard test corpora. The neural answer selection model employs a stochastic representation layer within an attention mechanism to extract the semantics between a question and answer pair. On two question answering benchmarks this model exceeds all previous published benchmarks.
  • 08:47 – A Deep Learning Approach to Unsupervised Ensemble Learning Uri Shaham Yale University, Xiuyuan Cheng , Omer Dror , Ariel Jaffe , Boaz Nadler , Joseph Chang , Yuval Kluger Paper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    We show how deep learning methods can be applied in the context of crowdsourcing and unsupervised ensemble learning.
    First, we prove that the popular model of Dawid and Skene, which assumes that all classifiers are
    conditionally independent, is {\em equivalent} to a Restricted Boltzmann Machine (RBM) with a single hidden node.
    Hence, under this model, the posterior probabilities of the true labels can be instead estimated via a trained RBM.
    Next, to address the more general case, where classifiers may strongly violate the conditional independence assumption,
    we propose to apply RBM-based Deep Neural Net (DNN).
    Experimental results on various simulated and real-world datasets demonstrate that our proposed DNN approach
    outperforms other state-of-the-art methods, in particular when the data violates the conditional independence assumption.
  • 09:04 – From Softmax to Sparsemax: A Sparse Model of Attention and Multi-Label Classification Andre Martins , Ramon Astudillo UnbabelPaper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    We propose sparsemax, a new activation function similar to the traditional softmax, but able to output sparse probabilities. After deriving its properties, we show how its Jacobian can be efficiently computed, enabling its use in a network trained with backpropagation. Then, we propose a new smooth and convex loss function which is the sparsemax analogue of the logistic loss. We reveal an unexpected connection between this new loss and the Huber classification loss. We obtain promising empirical results in multi-label classification problems and in attention-based neural networks for natural language inference. For the latter, we achieve a similar performance as the traditional softmax, but with a selective, more compact, attention focus.
  • 09:21 – A Neural Autoregressive Approach to Collaborative Filtering Yin Zheng Hulu LLC., Bangsheng Tang Hulu LLC, Wenkui Ding Hulu LLC., Hanning Zhou HuluPaper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    This paper proposes CF-NADE, a neural autoregressive architecture for collaborative filtering (CF) tasks, which is inspired by the Restricted Boltzmann Machine (RBM) based CF model and the Neural Autoregressive Distribution Estimator (NADE). We first describe the basic CF-NADE model for CF tasks. Then we propose to improve the model by sharing parameters between different ratings. A factored version of CF-NADE is also proposed for better scalability. Furthermore, we take the ordinal nature of the preferences into consideration and propose an ordinal cost to optimize CF-NADE, which shows superior performance. Finally, CF-NADE can be extended to a deep model, with only moderately increased computational complexity. Experimental results show that CF-NADE with a single hidden layer beats all previous state-of-the-art methods on MovieLens 1M, MovieLens 10M, and Netflix datasets, and adding more hidden layers can further improve the performance.
  • 09:38 – Scalable Gradient-Based Tuning of Continuous Regularization Hyperparameters Jelena Luketina Aalto University, Tapani Raiko , Mathias Berglund Aalto University, Klaus Greff IDSIAPaper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    Hyperparameter selection generally relies on running multiple full training trials, with selection based on validation set performance. We propose a gradient-based approach for locally adjusting hyperparameters during training of the model. Hyperparameters are adjusted so as to make the model parameter gradients, and hence updates, more advantageous for the validation cost. We explore the approach for tuning regularization hyperparameters and find that in experiments on MNIST, SVHN and CIFAR-10, the resulting regularization levels are within the optimal regions. The additional computational cost depends on how frequently the hyperparameters are trained, but the tested scheme adds only 30% computational overhead regardless of the model size. Since the method is significantly less computationally demanding compared to similar gradient-based approaches to hyperparameter optimization, and consistently finds good hyperparameter values, it can be a useful tool for training neural network models.
  • Wednesday – Optimization (Continuous)

    Session chair: Shie Mannor

    Location: Ballroom 3+4
  • 08:30 – SDNA: Stochastic Dual Newton Ascent for Empirical Risk Minimization Zheng Qu University of Hong Kong, Peter Richtarik , Martin Takac , Olivier Fercoq LTCI, CNRS, Télécom ParisTech, Université Paris-Saclay, 75013, Paris, FrancePaper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    We propose a new algorithm for minimizing regularized empirical loss: Stochastic Dual Newton Ascent (SDNA). Our method is dual in nature: in each iteration we update a random subset of the dual variables. However, unlike existing methods such as stochastic dual coordinate ascent, SDNA is capable of utilizing all local curvature information contained in the examples, which leads to striking improvements in both theory and practice — sometimes by orders of magnitude. In the special case when an L2-regularizer is used in the primal, the dual problem is a concave quadratic maximization problem plus a separable term. In this regime, SDNA in each step solves a proximal subproblem involving a random principal submatrix of the Hessian of the quadratic function; whence the name of the method.
  • 08:47 – Stochastic Block BFGS: Squeezing More Curvature out of Data Robert Gower University of Edinburgh, Donald Goldfarb Columbia University, Peter Richtarik Paper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    We propose a novel limited-memory stochastic block BFGS update for incorporating enriched curvature information in stochastic approximation methods. In our method, the estimate of the inverse Hessian matrix that is maintained by it, is updated at each iteration using a sketch of the Hessian, i.e., a randomly generated compressed form of the Hessian. We propose several sketching strategies, present a new quasi-Newton method that uses stochastic block BFGS updates combined with the variance reduction approach SVRG to compute batch stochastic gradients, and prove linear convergence of the resulting method. Numerical tests on large-scale logistic regression problems reveal that our method is more robust and substantially outperforms current state-of-the-art methods.
  • 09:04 – PD-Sparse : A Primal and Dual Sparse Approach to Extreme Multiclass and Multilabel Classification Ian En-Hsu Yen University of Texas at Austin, Xiangru Huang UTaustin, Pradeep Ravikumar UT Austin, Kai Zhong ICES department, University of Texas at Austin, Inderjit Paper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    We consider Multiclass and Multilabel classification with extremely large number of classes, of which only few are labeled to each instance. In such setting, standard methods that have training, prediction cost linear to the number of classes become intractable. State-of-the-art methods thus aim to reduce the complexity by exploiting correlation between labels under assumption that the similarity between labels can be captured by structures such as low-rank matrix or balanced tree. However, as the diversity of labels increases in the feature space, structural assumption can be easily violated, which leads to degrade in the testing performance. In this work, we show that a margin-maximizing loss with l1 penalty, in case of Extreme Classification, yields extremely sparse solution both in primal and in dual without sacrificing the expressive power of predictor. We thus propose a Fully-Corrective Block-Coordinate Frank-Wolfe (FC-BCFW) algorithm that exploits both primal and dual sparsity to achieve a complexity sublinear to the number of primal and dual variables. A bi-stochastic search method is proposed to further improve the efficiency. In our experiments on both Multiclass and Multilabel problems, the proposed method achieves significant higher accuracy than existing approaches of Extreme Classification with very competitive training and prediction time.
  • 09:21 – Parallel and Distributed Block-Coordinate Frank-Wolfe Algorithms Yu-Xiang Wang , Veeranjaneyulu Sadhanala , Wei Dai Carnegie Mellon University, Willie Neiswanger , Suvrit Sra , Eric Xing CMUPaper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    We study parallel and distributed Frank-Wolfe algorithms; the former on shared memory machines with mini-batching, and the latter in a delayed update framework. In both cases, we perform computations asynchronously whenever possible. We assume block-separable constraints as in Block-Coordinate Frank-Wolfe (BCFW) method (Lacoste et. al., 2013) , but our analysis subsumes BCFW and reveals problem-dependent quantities that govern the speedups of our methods over BCFW. A notable feature of our algorithms is that they do not depend on worst-case bounded delays, but only (mildly) on **expected** delays, making them robust to stragglers and faulty worker threads. We present experiments on structural SVM and Group Fused Lasso, and observe significant speedups over competing state-of-the-art (and synchronous) methods.
  • 09:38 – Minding the Gaps for Block Frank-Wolfe Optimization of Structured SVMs Anton Osokin , Jean-Baptiste Alayrac ENS, Isabella Lukasewitz INRIA, Puneet Dokania INRIA and Ecole Centrale Paris, Simon Lacoste-Julien INRIAPaper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    In this paper, we propose several improvements on the block-coordinate Frank-Wolfe (BCFW) algorithm from Lacoste-Julien et al. (2013) recently used to optimize the structured support vector machine (SSVM) objective in the context of structured prediction, though it has wider applications. The key intuition behind our improvements is that the estimates of block gaps maintained by BCFW reveal the block suboptimality that can be used as an *adaptive* criterion. First, we sample objects at each iteration of BCFW in an adaptive non-uniform way via gap-based sampling. Second, we incorporate pairwise and away-step variants of Frank-Wolfe into the block-coordinate setting. Third, we cache oracle calls with a cache-hit criterion based on the block gaps. Fourth, we provide the first method to compute an approximate regularization path for SSVM. Finally, we provide an exhaustive empirical evaluation of all our methods on four structured prediction datasets.
  • Session chair: Satyen Kale

    Location: Ballroom 3+4
  • 10:20 – On the Iteration Complexity of Oblivious First-Order Optimization Algorithms Yossi Arjevani Weizmann Institute of Science, Ohad Shamir Weizmann Institute of SciencePaper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    We consider a broad class of first-order optimization algorithms which are \emph{oblivious}, in the sense that their step sizes are scheduled regardless of the function under consideration, except for limited side-information such as smoothness or strong convexity parameters.
    With the knowledge of these two parameters, we show that any such algorithm attains an iteration complexity lower bound of $\Omega(\sqrt{L/\epsilon})$ for $L$-smooth convex functions, and $\tilde{\Omega}(\sqrt{L/\mu}\ln(1/\epsilon))$ for $L$-smooth $\mu$-strongly convex functions. These lower bounds are stronger than those in the traditional oracle model, as they hold independently of the dimension. To attain these, we abandon the oracle model in favor of a structure-based approach which builds upon a framework recently proposed in \cite{arjevani2015lower}. We further show that without knowing the strong convexity parameter, it is impossible to attain an iteration complexity better than $\tilde{\Omega}\circpar{(L/\mu)\ln(1/\epsilon)}$. This result is then used to formalize an observation regarding $L$-smooth convex functions, namely, that the iteration complexity of algorithms employing time-invariant step sizes must be at least $\Omega(L/\epsilon)$.
  • 10:37 – Variance-Reduced and Projection-Free Stochastic Optimization Elad Hazan Princeton University, Haipeng Luo Paper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    The Frank-Wolfe optimization algorithm has recently regained popularity for machine learning applications due to its projection-free property and its ability to handle structured constraints. However, in the stochastic learning setting, it is still relatively understudied compared to the gradient descent counterpart. In this work, leveraging a recent variance reduction technique, we propose two stochastic Frank-Wolfe variants which substantially improve previous results in terms of the number of stochastic gradient evaluations needed to achieve $1-\epsilon$ accuracy. For example, we improve from $O(\frac{1}{\epsilon})$ to $O(\ln\frac{1}{\epsilon})$ if the objective function is smooth and strongly convex, and from $O(\frac{1}{\epsilon^2})$ to $O(\frac{1}{\epsilon^{1.5}})$ if the objective function is smooth and Lipschitz. The theoretical improvement is also observed in experiments on real-world datasets for a multiclass classification application.
  • 10:54 – On Graduated Optimization for Stochastic Non-Convex Problems Elad Hazan Princeton University, Kfir Yehuda Levy Technion, Shai Shalev-Shwartz Hebrew University of JerusalemPaper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    The graduated optimization approach, also known as the continuation method, is a popular heuristic to solving non-convex problems that has received renewed interest over the last decade.Despite being popular, very little is known in terms of its theoretical convergence analysis.

    In this paper we describe a new first-order algorithm based on graduated optimization and analyze its performance. We characterize a family of non-convex functions for which this algorithm provably converges to a global optimum. In particular, we prove that the algorithm converges to an $\eps$-approximate solution within $O(1 / \eps^2)$ gradient-based steps.
    We extend our algorithm and analysis to the setting of stochastic non-convex optimization with noisy gradient feedback, attaining the same convergence rate.
    Additionally, we discuss the setting of “zero-order optimization”, and devise a variant of our algorithm which converges at rate of $O(d^2/ \eps^4)$.

  • 11:30 – A Self-Correcting Variable-Metric Algorithm for Stochastic Optimization Frank Curtis Lehigh UniversityPaper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    An algorithm for stochastic (convex or nonconvex) optimization is presented. The algorithm is variable-metric in the sense that, in each iteration, the step is computed through the product of a symmetric positive definite scaling matrix and a stochastic (mini-batch) gradient of the objective function, where the sequence of scaling matrices is updated dynamically by the algorithm. A key feature of the algorithm is that it does not overly restrict the manner in which the scaling matrices are updated. Rather, the algorithm exploits fundamental self-correcting properties of BFGS-type updating—properties that have been over-looked in other attempts to devise quasi-Newton methods for stochastic optimization. Numerical experiments illustrate that the method and a limited memory variant of it are stable and outperform (mini-batch) stochastic gradient and other quasi-Newton methods when employed to solve a few machine learning problems.
  • 11:47 – A Superlinearly-Convergent Proximal Newton-type Method for the Optimization of Finite Sums Anton Rodomanov Higher School of Economics, Dmitry Kropotov Moscow State UniversityPaper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    We consider the problem of minimizing the strongly convex sum of a finite number of convex functions. Standard algorithms for solving this problem in the class of incremental/stochastic methods have at most a linear convergence rate. We propose a new incremental method whose convergence rate is superlinear — the Newton-type incremental method (NIM). The idea of the method is to introduce a model of the objective with the same sum-of-functions structure and further update a single component of the model per iteration. We prove that NIM has a superlinear local convergence rate and linear global convergence rate. Experiments show that the method is very effective for problems with a large number of functions and a small number of variables.
  • 12:04 – Stochastic Variance Reduced Optimization for Nonconvex Sparse Learning Xingguo Li University of Minnesota, Tuo Zhao , Raman Arora Johns Hopkins University, Han , Jarvis Haupt Paper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    We propose a stochastic variance reduced optimization algorithm for solving a class of large-scale nonconvex optimization problems with cardinality constraints, and provide sufficient conditions under which the proposed algorithm enjoys strong linear convergence guarantees and optimal estimation accuracy in high dimensions. Numerical experiments demonstrate the efficiency of our method in terms of both parameter estimation and computational performance.
  • 03:40 – Energetic Natural Gradient Descent Philip Thomas CMU, Bruno Castro da Silva , Christoph Dann Carnegie Mellon University, Emma Paper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    We propose a new class of algorithms for minimizing or maximizing functions of parametric probabilistic models. These new algorithms are natural gradient algorithms that leverage more information than prior methods by using a new metric tensor in place of the commonly used Fisher information matrix. This new metric tensor is derived by computing directions of steepest ascent where the distance between distributions is measured using an approximation of energy distance (as opposed to Kullback-Leibler divergence, which produces the Fisher information matrix), and so we refer to our new ascent direction as the energetic natural gradient.
  • 03:57 – On the Quality of the Initial Basin in Overspecified Neural Networks Itay Safran Weizmann Institute of Science, Ohad Shamir Weizmann Institute of SciencePaper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    Deep learning, in the form of artificial neural networks, has achieved remarkable practical success in recent years, for a variety of difficult machine learning applications. However, a theoretical explanation for this remains a major open problem, since training neural networks involves optimizing a highly non-convex objective function, and is known to be computationally hard in the worst case. In this work, we study the \emph{geometric} structure of the associated non-convex objective function, in the context of ReLU networks and starting from a random initialization of the network parameters. We identify some conditions under which it becomes more favorable to optimization, in the sense of (i) High probability of initializing at a point from which there is a monotonically decreasing path to a global minimum; and (ii) High probability of initializing at a basin (suitably defined) with a small minimal objective value. A common theme in our results is that such properties are more likely to hold for larger (“overspecified”) networks, which accords with some recent empirical and theoretical observations.
  • 04:14 – L1-regularized Neural Networks are Improperly Learnable in Polynomial Time Yuchen Zhang , Jason , Michael Paper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    We study the improper learning of multi-layer neural networks. Suppose that the neural network to be learned has $k$ hidden layers and that the $\ell_1$-norm of the incoming weights of any neuron is bounded by $L$. We present a kernel-based method, such that with probability at least $1 – \delta$, it learns a predictor whose generalization error is at most $\epsilon$ worse than that of the neural network. The sample complexity and the time complexity of the presented method are polynomial in the input dimension and in $(1/\epsilon,\log(1/\delta),F(k,L))$, where $F(k,L)$ is a function depending on $(k,L)$ and on the activation function, independent of the number of neurons. The algorithm applies to both sigmoid-like activation functions and ReLU-like activation functions. It implies that any sufficiently sparse neural network is learnable in polynomial time.
  • Wednesday – Multi-label, multi-task, and neural networks

    Session chair: Joelle Pineau

    Location: Marquis
  • 08:30 – Asymmetric Multi-task Learning based on Task Relatedness and Confidence Giwoong Lee UNIST, Eunho Yang IBM Research, Sung ju Hwang UNISTPaper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    We propose a novel multi-task learning method that can minimize the effect of negative transfer by allowing asymmetric transfer between the tasks based on task relatedness as well as the amount of individual task losses, which we refer to as Asymmetric Multi-task Learning (AMTL). To tackle this problem, we couple multiple tasks via a sparse, directed regularization graph, that enforces each task parameter to be reconstructed as a sparse combination of other tasks, which are selected based on the task-wise loss. We present two different algorithms to solve this joint learning of the task predictors and the regularization graph. The first algorithm solves for the original learning objective using alternative optimization, and the second algorithm solves an approximation of it using curriculum learning strategy, that learns one task at a time. We perform experiments on multiple datasets for classification and regression, on which we obtain significant improvements in performance over the single task learning and symmetric multitask learning baselines.
  • 08:47 – Training Deep Neural Networks via Direct Loss Minimization Yang Song Tsinghua University, Alexander Schwing , Richard , Raquel Urtasun U. of TorontoPaper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    Supervised training of deep neural nets typically relies on minimizing cross-entropy. However, in many domains, we are interested in performing well on metrics specific to the application. In this paper we propose a direct loss minimization approach to train deep neural networks, which provably minimizes the application-specific loss function. This is often non-trivial, since these functions are neither smooth nor decomposable and thus are not amenable to optimization with standard gradient-based methods. We demonstrate the effectiveness of our approach in the context of maximizing average precision for ranking problems. Towards this goal, we develop a novel dynamic programming algorithm that can efficiently compute the weight updates. Our approach proves superior to a variety of baselines in the context of action classification and object detection, especially in the presence of label noise.
  • 09:04 – Structured Prediction Energy Networks David Belanger University of Massachusetts Am, Andrew McCallum Paper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    We introduce structured prediction energy networks (SPENs), a flexible framework for structured prediction. A deep architecture is used to define an energy function of candidate labels, and then predictions are produced by using back-propagation to iteratively optimize the energy with respect to the labels. This deep architecture captures dependencies between labels that would lead to intractable graphical models, and performs structure learning by automatically learning discriminative features of the structured output. One natural application of our technique is multi-label classification, which traditionally has required strict prior assumptions about the interactions between labels to ensure tractable learning and prediction. We are able to apply SPENs to multi-label problems with substantially larger label sets than previous applications of structured prediction, while modeling high-order interactions using minimal structural assumptions. Overall, deep learning provides remarkable tools for learning features of the inputs to a prediction problem, and this work extends these techniques to learning features of structured outputs. Our experiments provide impressive performance on a variety of benchmark multi-label classification tasks, demonstrate that our technique can be used to provide interpretable structure learning, and illuminate fundamental trade-offs between feed-forward and iterative structured prediction.
  • 09:21 – Conditional Bernoulli Mixtures for Multi-label Classification Cheng Li Northeastern University, Bingyu Wang Northeastern University, Virgil Pavlu Northeastern University, Javed Aslam Northeastern UniversityPaper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    Multi-label classification is an important machine learning task wherein one assigns a subset of candidate labels to an object. In this paper, we propose a new multi-label classification method based on Conditional Bernoulli Mixtures. Our proposed method has several attractive properties: it captures label dependencies; it reduces the multi-label problem to several standard binary and multi-class problems; it subsumes the classic independent binary prediction and power-set subset prediction methods as special cases; and it exhibits accuracy and/or computational complexity advantages over existing approaches. We demonstrate two implementations of our method using logistic regressions and gradient boosted trees, together with a simple training procedure based on Expectation Maximization. We further derive an efficient prediction procedure based on dynamic programming, thus avoiding the cost of examining an exponential number of potential label subsets. Experimental results show the effectiveness of the proposed method against competitive alternatives on benchmark datasets.
  • 09:38 – Training Neural Networks Without Gradients: A Scalable ADMM Approach Gavin Taylor US Naval Academy, Ryan Burmeister US Naval Academy, Zheng Xu University of Maryland, Bharat Singh University of Maryland, Colleg, Ankit Patel Rice University, Tom Goldstein University of MarylandPaper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    With the growing importance of large network models and enormous training datasets, GPUs have become increasingly necessary to train neural networks. This is largely because conventional optimization algorithms rely on stochastic gradient methods that don’t scale well to large numbers of cores in a cluster setting. Furthermore, the convergence of all gradient methods, including batch methods, suffers from common problems like saturation effects, poor conditioning, and saddle points. This paper explores an unconventional training method that uses alternating direction methods and Bregman iteration to train networks without gradient descent steps. The proposed method reduces the network training problem to a sequence of minimization sub-steps that can each be solved globally in closed form. The proposed method is advantageous because it avoids many of the caveats that make gradient methods slow on highly non-convex problems. In addition, the method exhibits strong scaling in the distributed setting, yielding linear speedups even when split over thousands of cores.
  • Wednesday – Gaussian Processes

    Session chair: Roger Grosse

    Location: Lyceum
  • 08:30 – Stability of Controllers for Gaussian Process Forward Models Julia Vinogradska Robert Bosch GmBH, Bastian Bischoff , Duy Nguyen-Tuong , Anne Romer , Henner Schmidt , Jan Peters Paper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    Learning control has become an appealing alternative to the derivation of control laws based on classic control theory. However, a major shortcoming of learning control is the lack of performance guarantees which prevents its application in many real-world scenarios. As a step in this direction, we provide a stability analysis tool for controllers acting on dynamics represented by Gaussian processes (GPs). We consider arbitrary Markovian control policies and system dynamics given as (i) the mean of a GP, and (ii) the full GP distribution. For the first case, our tool finds a state space region, where the closed-loop system is provably stable. In the second case, it is well known that infinite horizon stability guarantees cannot exist. Instead, our tool analyzes finite time stability. Empirical evaluations on simulated benchmark problems support our theoretical results.
  • 08:47 – A Distributed Variational Inference Framework for Unifying Parallel Sparse Gaussian Process Regression Models Trong Nghia Hoang NUS, Quang Minh Hoang NUS, Bryan Kian Hsiang Low NUSPaper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    This paper presents a novel distributed variational inference framework that unifies many parallel sparse Gaussian process regression (SGPR) models for scalable hyperparameter learning with big data. To achieve this, our framework exploits a structure of correlated noise process model that represents the observation noises as a finite realization of a high-order Gaussian Markov random process. By varying the Markov order and covariance function for the noise process model, different variational SGPR models result. This consequently allows the correlation structure of the noise process model to be characterized for which a particular variational SGPR model is optimal. We empirically evaluate the predictive performance and scalability of the distributed variational SGPR models unified by our framework on two real-world datasets.
  • 09:04 – Deep Gaussian Processes for Regression using Approximate Expectation Propagation Thang Bui University of Cambridge, Daniel Hernandez-Lobato , Jose miguel Hernandez-Lobato , Yingzhen Li University of Cambridge, Richard Turner University of CambridgePaper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    Deep Gaussian processes (DGPs) are multi-layer hierarchical generalisations of Gaussian processes (GPs) and are formally equivalent to neural networks with multiple, infinitely wide hidden layers. DGPs are nonparametric probabilistic models and as such are arguably more flexible, have a greater capacity to generalise, and provide better calibrated uncertainty estimates than alternative deep models. This paper develops a new approximate Bayesian learning scheme that enables DGPs to be applied to a range of medium to large scale regression problems for the first time. The new method uses an approximate Expectation Propagation procedure and a novel and efficient extension of the probabilistic backpropagation algorithm for learning. We evaluate the new method for non-linear regression on eleven real-world datasets, showing that it always outperforms GP regression and is almost always better than state-of-the-art deterministic and sampling-based approximate inference methods for Bayesian neural networks. As a by-product, this work provides a comprehensive analysis of six approximate Bayesian methods for training neural networks.
  • 09:21 – Preconditioning Kernel Matrices Kurt Cutajar EURECOM, Michael Osborne , John Cunningham Columbia University, Maurizio Filippone EURECOMPaper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    The computational and storage complexity of kernel machines presents the primary barrier to their scaling to large, modern, datasets. A common way to tackle the scalability issue is to use the conjugate gradient algorithm, which relieves the constraints on both storage (the kernel matrix need not be stored) and computation (both stochastic gradients and parallelization can be used). Even so, conjugate gradient is not without its own issues: the conditioning of kernel matrices is often such that conjugate gradients will have poor convergence in practice. Preconditioning is a common approach to alleviating this issue. Here we propose preconditioned conjugate gradients for kernel machines, and develop a broad range of preconditioners particularly useful for kernel matrices. We describe a scalable approach to both solving kernel machines and learning their hyperparameters. We show this approach is exact in the limit of iterations and outperforms state-of-the-art approximations for a given computational budget.
  • 09:38 – Extended and Unscented Kitchen Sinks Edwin Bonilla UNSW, Daniel Steinberg DATA61, Alistair Reid Data61Paper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    We propose a scalable multiple-output generalization of unscented and extended Gaussian processes. These algorithms have been designed to handle general likelihood models by linearizing them using a Taylor series or the Unscented Transform in a variational inference framework. We build upon random feature approximations of Gaussian process covariance functions and show that, on small-scale single-task problems, our methods can attain similar performance as the original algorithms while having less computational cost. We also evaluate our methods at a larger scale on MNIST and on a seismic inversion which is inherently a multi-task problem.
  • Wednesday – Feature Selection and Dimensionality Reduction

    Session chair: Laurens van der Maaten

    Location: Empire
  • 08:30 – On the Consistency of Feature Selection With Lasso for Non-linear Targets Yue Zhang Case Western Reserve University, Weihong Guo Case Western Reserve University, Soumya Ray Paper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    An important question in feature selection is whether a selection strategy recovers the “true” set of features, given enough data. We study this question in the context of the popular Least Absolute Shrinkage and Selection Operator (Lasso) feature selection strategy. In particular, we consider the scenario when the model is misspecified so that the learned model is linear while the underlying real target is nonlinear. Surprisingly, we prove that under certain conditions, Lasso is still able to recover the correct features in this case. We also carry out numerical studies to empirically verify the theoretical results and explore the necessity of the conditions under which the proof holds.
  • 08:47 – No penalty no tears: Least squares in high-dimensional linear models Xiangyu Wang Duke University, David , Chenlei Leng University of WarwickPaper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    Ordinary least squares (OLS) is the default method for fitting linear models, but is
    not applicable for problems with dimensionality larger than the sample
    size. For these problems, we advocate the use of a generalized version of OLS
    motivated by ridge regression, and propose two novel three-step algorithms involving least squares fitting and hard thresholding. The algorithms are methodologically simple to
    understand intuitively, computationally easy to implement efficiently, and
    theoretically appealing for choosing models consistently. Numerical exercises comparing
    our methods with penalization-based approaches in simulations and data
    analyses illustrate the great potential of the proposed algorithms.
  • 09:04 – Simultaneous Safe Screening of Features and Samples in Doubly Sparse Modeling Atsushi Shibagaki Nagoya Institute of Technology, Masayuki Karasuyama Nagoya Institute of Technology, Kohei Hatano Kyushu University, Ichiro Takeuchi Paper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    The problem of learning a sparse model is conceptually interpreted as the process of identifying active features/samples and then optimizing the model over them. Recently introduced safe screening allows us to identify a part of non-active features/samples. So far, safe screening has been individually studied either for feature screening or for sample screening. In this paper, we introduce a new approach for safely screening features and samples simultaneously by alternatively iterating feature and sample screening steps. A significant advantage of considering them simultaneously rather than individually is that they have a synergy effect in the sense that the results of the previous safe feature screening can be exploited for improving the next safe sample screening performances, and vice-versa. We first theoretically investigate the synergy effect, and then illustrate the practical advantage through intensive numerical experiments for problems with large numbers of features and samples.
  • 09:21 – Efficient Learning with a Family of Nonconvex Regularizers by Redistributing Nonconvexity Quanming Yao HKUST, James Kwok Hong Kong University Science TechnologyPaper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    The use of convex regularizers allow for easy optimization, though they often produce biased estimation and inferior prediction performance. Recently, nonconvex regularizers have attracted a lot of attention and outperformed convex ones. However, the resultant optimization problem is much harder. In this paper, for a large class of nonconvex regularizers, we propose to move the nonconvexity from the regularizer to the loss. The nonconvex regularizer is then transformed to a familiar convex regularizer, while the resultant loss function can still be guaranteed to be smooth. Learning with the convexified regularizer can be performed by existing efficient algorithms originally designed for convex regularizers (such as the standard proximal algorithm and Frank-Wolfe algorithm). Moreover, it can be shown that critical points of the transformed problem are also critical points of the original problem. Extensive experiments on a number of nonconvex regularization problems show that the proposed procedure is much faster than the state-of-the-art nonconvex solvers.
  • 09:38 – How to Fake Multiply by a Gaussian Matrix Michael Kapralov , Vamsi Potluru Comcast Cable, David Woodruff Paper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    Have you ever wanted to multiply an $n \times d$ matrix $X$, with $n \gg d$,
    on the left by an $m \times n$ matrix $\tilde G$ of i.i.d. Gaussian random variables,
    but could not afford to do it because it was too slow? In this work
    we propose a new randomized $m \times n$ matrix $T$, for which one can
    compute $T \cdot X$ in only $O(\nnz(X)) + \tilde O(m^{1.5} \cdot d^{3})$ time, for which
    the total variation distance between the distributions $T \cdot X$ and $\tilde G \cdot X$
    is as small as desired, i.e., less than any positive constant. Here
    $\nnz(X)$ denotes the number of non-zero entries of $X$. Assuming
    $\nnz(X) \gg m^{1.5} \cdot d^{3}$,
    this is a significant savings over the na\”ive $O(\nnz(X) m)$ time to compute $\tilde G \cdot X$.
    Moreover, since the total variation distance is small, we can provably use $T \cdot X$
    in place of $\tilde G \cdot X$ in any application and have the same guarantees as if we were using
    $\tilde G \cdot X$, up to a small
    positive constant in error probability.
    We apply this transform to nonnegative matrix
    factorization (NMF) and support vector machines (SVM).

  • Wednesday – Graph Analysis/ Spectral Methods

    Session chair: Alex Kulesza

    Location: Soho
  • 08:30 – Metadata-conscious anonymous messaging Giulia Fanti UIUC, Peter Kairouz UIUC, Sewoong Oh UIUC, Kannan Ramchandran UC Berkeley, Pramod Viswanath UIUCPaper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    Anonymous messaging platforms like Whisper and Yik Yak allow users to spread messages over a network (e.g., a social network) without revealing message authorship to other users. The spread of messages on these platforms can be modeled by a diffusion process over a graph. Recent advances in network analysis have revealed that such diffusion processes are vulnerable to author deanonymization by adversaries with access to metadata, such as timing information. In this work, we ask the fundamental question of how to propagate anonymous messages over a graph to make it difficult for adversaries to infer the source. In particular, we study the performance of a message propagation protocol called adaptive diffusion introduced in (Fanti et al., 2015). We prove that when the adversary has access to metadata at a fraction of corrupted graph nodes, adaptive diffusion achieves asymptotically optimal source-hiding and significantly outperforms standard diffusion. We further demonstrate empirically that adaptive diffusion hides the source effectively on real social networks.
  • 08:47 – A Simple and Strongly-Local Flow-Based Method for Cut Improvement Nate Veldt Purdue Unversity, David Gleich Purdue University, Michael Paper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    Many graph-based learning problems can be cast as finding a good set of vertices nearby a seed set, and a powerful methodology for these problems is based on minimum cuts and maximum flows. We introduce and analyze a new method for locally-biased graph-based learning called SimpleLocal, which finds good conductance cuts near a set of seed vertices. An important feature of our algorithm is that it is strongly-local, meaning it does not need to explore the entire graph to find cuts that are locally optimal. This method is related to other strongly-local flow-based methods, but it enables a simple implementation. We also show how it achieves localization through an implicit l1-norm penalty term. As a flow-based method, our algorithm exhibits several advantages in terms of cut optimality and accurate identification of target regions in a graph. We demonstrate the power of SimpleLocal solving segmentation problems on a 467 million edge graph based on an MRI scan.
  • 09:04 – Community Recovery in Graphs with Locality Yuxin Chen Stanford University, Govinda Kamath Stanford University, Changho Suh KAIST, David Tse Stanford UniversityPaper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    Motivated by applications in domains such as social networks and computational biology, we study the problem of community recovery in graphs with locality. In this problem, pairwise noisy measurements of whether two nodes are in the same community or different communities come mainly or exclusively from nearby nodes rather than uniformly sampled between all node pairs, as in most existing models. We present two algorithms that run nearly linearly in the number of measurements and which achieve the information limits for exact recovery.
  • 09:21 – Interactive Bayesian Hierarchical Clustering Sharad Vikram UCSD, Sanjoy Dasgupta UCSDPaper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    Clustering is a powerful tool in data analysis, but it is often difficult to find a grouping that aligns with a user’s needs. To address this, several methods incorporate constraints obtained from users into clustering algorithms, but unfortunately do not apply to hierarchical clustering. We design an interactive Bayesian algorithm that incorporates user interaction into hierarchical clustering while still utilizing the geometry of the data by sampling a constrained posterior distribution over hierarchies. We also suggest several ways to intelligently query a user. The algorithm, along with the querying schemes, shows promising results on real data.
  • 09:38 – Cross-Graph Learning of Multi-Relational Associations Hanxiao Liu Carnegie Mellon University, Yiming Yang Paper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    Cross-graph Relational Learning (CGRL) refers to the problem of predicting the strengths or labels of multi-relational tuples of heterogeneous object types, through the joint inference over multiple graphs which specify the internal connections among each type of objects. CGRL is an open challenge in machine learning due to the daunting number of all possible tuples to deal with when the numbers of nodes in multiple graphs are large, and because the labeled training instances are extremely sparse as typical. Existing methods such as tensor factorization or tensor-kernel machines do not work well because of the lack of convex formulation for the optimization of CGRL models, the poor scalability of the algorithms in handling combinatorial numbers of tuples, and/or the non-transductive nature of the learning methods which limits their ability to leverage unlabeled data in training. This paper proposes a novel framework which formulates CGRL as a convex optimization problem, enables transductive learning using both labeled and unlabeled tuples, and offers a scalable algorithm that guarantees the optimal solution and enjoys a constant time complexity with respect to the sizes of input graphs. In our experiments with a subset of DBLP publication records and an Enzyme multi-source dataset, the proposed method successfully scaled to the large cross-graph inference problem, and outperformed other representative approaches significantly.
  • Wednesday – Ranking and Preference Learning

    Session chair: Tong Zhang

    Location: Liberty
  • 08:30 – Controlling the distance to a Kemeny consensus without computing it Anna Korba Telecom Paris Tech, Yunlong Jiao Mines Paris Tech, Eric Sibony Telecom Paris TechPaper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    Due to its numerous applications, rank aggregation has become a problem of major interest across many fields of the computer science literature. In the vast majority of situations, Kemeny consensus(es) are considered as the ideal solutions. It is however well known that their computation is NP-hard. Many contributions have thus established various results to apprehend this complexity. In this paper we introduce a practical method to predict, for a ranking and a dataset, how close the Kemeny consensus(es) are to this ranking. A major strength of this method is its generality: it does not require any assumption on the dataset nor the ranking. Furthermore, it relies on a new geometric interpretation of Kemeny aggregation that, we believe, could lead to many other results.
  • 08:47 – Data-driven Rank Breaking for Efficient Rank Aggregation Ashish Khetan UIUC, Sewoong Oh UIUCPaper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    Rank aggregation systems collect ordinal preferences from individuals to produce a global ranking that represents the social preference. To reduce the computational complexity of learning the global ranking, a common practice is to use rank-breaking. Individuals’ preferences are broken into pairwise comparisons and then applied to efficient algorithms tailored for independent pairwise comparisons. However, due to the ignored dependencies, naive rank-breaking approaches can result in inconsistent estimates. The key idea to produce unbiased and accurate estimates is to treat the paired comparisons outcomes unequally, depending on the topology of the collected data. In this paper, we provide the optimal rank-breaking estimator, which not only achieves consistency but also achieves the best error bound. This allows us to characterize the fundamental tradeoff between accuracy and complexity in some canonical scenarios. Further, we identify how the accuracy depends on the spectral gap of a corresponding comparison graph.
  • 09:04 – Parameter Estimation for Generalized Thurstone Choice Models Milan Vojnovic Microsoft, Seyoung Yun MicrosoftPaper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    We consider the maximum likelihood parameter estimation problem for a generalized Thurstone choice model, where choices are from comparison sets of two or more items. We provide tight characterizations of the mean square error, as well as necessary and sufficient conditions for correct classification when each item belongs to one of two classes. These results provide insights into how the estimation accuracy depends on the choice of a generalized Thurstone choice model and the structure of comparison sets. We find that for a priori unbiased structures of comparisons, e.g., when comparison sets are drawn independently and uniformly at random, the number of observations needed to achieve a prescribed estimation accuracy depends on the choice of a generalized Thurstone choice model. For a broad set of generalized Thurstone choice models, which includes all popular instances used in practice, the estimation error is shown to be largely insensitive to the cardinality of comparison sets. On the other hand, we found that there exist generalized Thurstone choice models for which the estimation error decreases much faster with the cardinality of comparison sets.
  • 09:21 – Learning Mixtures of Plackett-Luce Models Zhibing Zhao RPI, Peter Piech RPI, Lirong Xia RPIPaper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    In this paper we address the identifiability and efficient learning problems of finite mixtures of Plackett-Luce models for rank data. We prove that for any $k\geq 2$, the mixture of $k$ Plackett-Luce models for no more than $2k-1$ alternatives is non-identifiable and this bound is tight for $k=2$. For generic identifiability, we prove that the mixture of $k$ Plackett-Luce models over $m$ alternatives is {\em generically identifiable} if $k\leq\lfloor\frac {m-2} 2\rfloor!$. We also propose an efficient generalized method of moments (GMM) algorithm to learn the mixture of two Plackett-Luce models and show that the algorithm is consistent. Our experiments show that our GMM algorithm is significantly faster than the EMM algorithm by Gormley & Murphy (2008), while achieving competitive statistical efficiency.
  • 09:38 – Recommendations as Treatments: Debiasing Learning and Evaluation Tobias Schnabel Cornell University, Adith Swaminathan Cornell University, Ashudeep Singh Cornell University, Navin Chandak Google, Thorsten Joachims CornellPaper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    Most data for evaluating and training recommender systems is subject to selection biases, either through self-selection by the users or through the actions of the recommendation system itself. In this paper, we provide a principled approach to handle selection biases by adapting models and estimation techniques from causal inference. The approach leads to unbiased performance estimators despite biased data, and to a matrix factorization method that provides substantially improved prediction performance on real-world data. We theoretically and empirically characterize the robustness of the approach, and find that it is highly practical and scalable.
  • Wednesday – Neural Networks and Deep Learning

    Session chair: Yoshua Bengio

    Location: Ballroom 1+2+Juliard
  • 10:20 – Generative Adversarial Text to Image Synthesis Scott Reed , Zeynep Akata Max Planck Institute for Informatics, Xinchen Yan University of Michigan, Lajanugen Logeswaran University of Michigan – Ann Arbor, Bernt Schiele , Honglak Lee University of MichiganPaper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    Automatic synthesis of realistic images from text would be interesting and useful, but current AI systems are still far from this goal. However, in recent years generic and powerful recurrent neural network architectures have been developed to learn discriminative text feature representations. Meanwhile, deep convolutional generative adversarial networks (GANs) have begun to generate highly compelling images of specific categories such as faces, album covers, room interiors and flowers. In this work, we develop a novel deep architecture and GAN formulation to effectively bridge these advances in text and image modeling, translating visual concepts from characters to pixels. We demonstrate the capability of our model to generate plausible images of birds and flowers from detailed text descriptions.
  • 10:37 – Autoencoding beyond pixels using a learned similarity metric Anders Boesen Lindbo Larsen Technical University of Denmar, Søren Kaae Sønderby University of Copenagen, Hugo Larochelle Twitter, Ole Winther Technical University of DenmarkPaper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    We present an autoencoder that leverages learned representations to better measure similarities in data space.
    By combining a variational autoencoder (VAE) with a generative adversarial network (GAN) we can use learned feature representations in the GAN discriminator as basis for the VAE reconstruction objective.
    Thereby, we replace element-wise errors with feature-wise errors to better capture the data distribution while offering invariance towards e.g. translation.
    We apply our method to images of faces and show that it outperforms VAEs with element-wise similarity measures in terms of visual fidelity.
    Moreover, we show that the method learns an embedding in which high-level abstract visual features (e.g. wearing glasses) can be modified using simple arithmetic.
  • 10:54 – Exploiting Cyclic Symmetry in Convolutional Neural Networks Sander Dieleman Google DeepMind, Jeffrey De Fauw Google DeepMind, Koray Kavukcuoglu Google DeepmindPaper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    Many classes of images exhibit rotational symmetry. Convolutional neural networks are sometimes trained using data augmentation to exploit this, but they are still required to learn the rotation equivariance properties from the data. Encoding these properties into the network architecture, as we are already used to doing for translation equivariance by using convolutional layers, could result in a more efficient use of the parameter budget by relieving the model from learning them. We introduce four operations which can be inserted into neural network models as layers, and which can be combined to make these models partially equivariant to rotations. They also enable parameter sharing across different orientations. We evaluate the effect of these architectural modifications on three datasets which exhibit rotational symmetry and demonstrate improved performance with smaller models.
  • 11:30 – A Comparative Analysis and Study of Multiview CNN Models for Joint Object Categorization and Pose Estimation Mohamed Elhoseiny Rutgers University, Tarek El-Gaaly Rutgers University, Amr Bakry Rutgers University, Ahmed Elgammal Rutgers UniversityPaper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    In the Object Recognition task, there exists a dichotomy between the categorization of objects and estimating object pose, where the former necessitates a view-invariant representation, while the latter requires a representation capable of capturing pose information over different categories of objects. With the rise of deep architectures, the prime focus has been on object category recognition. Deep learning methods have achieved wide success in this task. In contrast, object pose estimation using these approaches has received relatively less attention. In this work, we study how Convolutional Neural Networks (CNN) architectures can be adapted to the task of simultaneous object recognition and pose estimation. We investigate and analyze the layers of various CNN models and extensively compare between them with the goal of discovering how the layers of distributed representations within CNNs represent object pose information and how this contradicts with object category representations. We extensively experiment on two recent large and challenging multi-view datasets and we achieve better than the state-of-the-art.

  • 11:47 – Dynamic Capacity Networks Amjad Almahairi , Nicolas Ballas , Tim Cooijmans University of Montreal, Yin Zheng Hulu LLC., Hugo Larochelle Twitter, Aaron Courville Paper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    We introduce the Dynamic Capacity Network (DCN), a neural network
    that can adaptively assign its capacity across different portions of
    the input data. This is achieved by combining modules of two types:
    low-capacity sub-networks and high-capacity sub-networks. The
    low-capacity sub-networks are applied across most of the input, but
    also provide a guide to select a few portions of the input on which
    to apply the high-capacity sub-networks. The selection is made using
    a novel gradient-based attention mechanism, that efficiently
    identifies input regions for which the DCN’s output is most
    sensitive and to which we should devote more capacity. We focus our
    empirical evaluation on the Cluttered MNIST and SVHN image datasets.
    Our findings indicate that DCNs are able to drastically reduce the
    number of computations, compared to traditional convolutional neural
    networks, while maintaining similar or even better performance.
  • 12:04 – Augmenting Supervised Neural Networks with Unsupervised Objectives for Large-scale Image Classification Yuting Zhang University of Michigan, Kibok Lee University of Michigan, Honglak Lee University of MichiganPaper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    Unsupervised learning and supervised learning are key research topics in deep learning. However, as high-capacity supervised neural networks trained with a large amount of labels have achieved remarkable success in many computer vision tasks, the availability of large-scale labeled images reduced the significance of unsupervised learning. Inspired by the recent trend toward revisiting the importance of unsupervised learning, we investigate joint supervised and unsupervised learning in a large-scale setting by augmenting existing neural networks with decoding pathways for reconstruction. First, we demonstrate that the intermediate activations of pretrained large-scale classification networks preserve almost all the information of input images except a portion of local spatial details. Then, by end-to-end training of the entire augmented architecture with the reconstructive objective, we show improvement of the network performance for supervised tasks. We evaluate several variants of autoencoders, including the recently proposed “what-where” autoencoder that uses the encoder pooling switches, to study the importance of the architecture design. Taking the 16-layer VGGNet trained under the ImageNet ILSVRC 2012 protocol as a strong baseline for image classification, our methods improve the validation-set accuracy by a noticeable margin.
  • Wednesday – Applications and Time-Series Analysis

    Session chair: Jon Mcauliffe

    Location: Marquis
  • 10:20 – Hierarchical Decision Making In Electricity Grid Management Gal Dalal Technion, Elad Gilboa Technion, Shie Mannor TechnionPaper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    The power grid is a complex and vital system that necessitates careful reliability management. Managing the grid is a difficult problem with multiple time scales of decision making and stochastic behavior due to renewable energy generations, variable demand and unplanned outages. Solving this problem in the face of uncertainty requires a new methodology with tractable algorithms. In this work, we introduce a new model for hierarchical decision making in complex systems. We apply reinforcement learning (RL) methods to learn a proxy, i.e., a level of abstraction, for real-time power grid reliability. We devise an algorithm that alternates between slow time-scale policy improvement, and fast time-scale value function approximation. We compare our results to prevailing heuristics, and show the strength of our method.
  • 10:37 – ForecastICU: A Prognostic Decision Support System for Timely Prediction of Intensive Care Unit Admission Jinsung Yoon University of California, Los , Ahmed Alaa University of California, Los Angeles, Scott Hu University of California, Los Angeles, Mihaela van der Schaar Paper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    We develop ForecastICU: a prognostic decision support system that monitors hospitalized patients and prompts alarms for intensive care unit (ICU) admissions. ForecastICU is first trained in an offline stage by constructing a Bayesian belief system that corresponds to its belief about how trajectories of physiological data streams of the patient map to a clinical status. After that, ForecastICU monitors a new patient in real-time by observing her physiological data stream, updating its belief about her status over time, and prompting an alarm whenever its belief process hits a predefined threshold (confidence). Using a real-world dataset obtained from UCLA Ronald Reagan Medical Center, we show that ForecastICU can predict ICU admissions 9 hours before a physician’s decision (for a sensitivity of 40% and a precision of 50%). Also, ForecastICU performs consistently better than other state-of-the-art machine learning algorithms in terms of sensitivity, precision, and timeliness: it can predict ICU admissions 3 hours earlier, and offers a 7.8% gain in sensitivity and a 5.1% gain in precision compared to the best state-of-the-art algorithm. Moreover, ForecastICU offers an area under curve (AUC) gain of 22.3% compared to the Rothman index, which is the currently deployed technology in most hospital wards.
  • 10:54 – Power of Ordered Hypothesis Testing Lihua Lei Lihua, William Fithian UC Berkeley, Department of StatisticsPaper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    Ordered testing procedures are multiple testing procedures that exploit a pre-specified ordering of the null hypotheses, from most to least promising. We analyze and compare the power of several recent proposals using the asymptotic framework of Li & Barber (2015). While accumulation tests including ForwardStop can be quite powerful when the ordering is very informative, they are asymptotically powerless when the ordering is weaker. By contrast, Selective SeqStep, proposed by Barber & Candes (2015), is much less sensitive to the quality of the ordering. We compare the power of these procedures in different regimes, concluding that Selective SeqStep dominates accumulation tests if either the ordering is weak or non-null hypotheses are sparse or weak. Motivated by our asymptotic analysis, we derive an improved version of Selective SeqStep which we call Adaptive SeqStep, analogous to Storey’s improvement on the Benjamini-Hochberg proce- dure. We compare these methods using the GEO-Query data set analyzed by (Li & Barber, 2015) and find Adaptive SeqStep has favorable performance for both good and bad prior orderings.
  • 11:30 – Learning to Filter with Predictive State Inference Machines Wen Sun Carnegie Mellon University, Arun Venkatraman Carnegie Mellon University, Byron Boots , J.Andrew Bagnell Carnegie Mellon UniversityPaper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    Latent state space models are a fundamental and widely used tool for modeling dynamical systems. However, they are difficult to learn from data and learned models often lack performance guarantees on inference tasks such as filtering and prediction. In this work, we present the PREDICTIVE STATE INFERENCE MACHINE (PSIM), a data-driven method that considers the inference procedure on a dynamical system as a composition of predictors. The key idea is that rather than first learning a latent state space model, and then using the learned model for inference, PSIM directly learns predictors for inference in predictive state space. We provide theoretical guarantees for inference, in both realizable and agnostic settings, and showcase practical performance on a variety of simulated and real world robotics benchmarks.
  • 11:47 – Learning Population-Level Diffusions with Generative RNNs Tatsunori Hashimoto MIT, David Gifford MIT, Tommi Jaakkola MITPaper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    We estimate stochastic processes that govern the dynamics of evolving populations such as cell differentiation. The problem is challenging since longitudinal trajectory measurements of individuals in a population are rarely available due to experimental cost and/or privacy. We show that cross-sectional samples from an evolving population suffice for recovery within a class of processes even if samples are available only at a few distinct time points. We provide a stratified analysis of recoverability conditions, and establish that reversibility is sufficient for recoverability. For estimation, we derive a natural loss and regularization, and parameterize the processes as diffusive recurrent neural networks. We demonstrate the approach in the context of uncovering complex cellular dynamics known as the `epigenetic landscape’ from existing biological assays.
  • 12:04 – Fast Parameter Inference in Nonlinear Dynamical Systems using Iterative Gradient Matching Mu Niu University of Glasgow, Simon Rogers University of Glasgow, Maurizio Filippone EURECOM, Dirk Husmeier University of GlasgowPaper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    Parameter inference in mechanistic models of coupled differential equations is a topical and challenging problem. We propose a new method based on kernel ridge regression and gradient matching, and an objective function that simultaneously encourages goodness of fit and penalises inconsistencies with the differential equations. Fast minimisation is achieved by exploiting partial convexity inherent in this function, and setting up an iterative algorithm in the vein of the EM algorithm. An evaluation of the proposed method on various benchmark data suggests that it compares favourably with
    state-of-the-art alternatives.
  • Wednesday – Dimensionality Reduction / Private Learning

    Session chair: Jeff Bilmes

    Location: Lyceum
  • 10:20 – Greedy Column Subset Selection: New Bounds and Distributed Algorithms Jason Altschuler Princeton University, Aditya Bhaskara , Gang Fu Google Research, Vahab Mirrokni Google Research, Afshin Rostamizadeh Google, Morteza Zadimoghaddam Google ResearchPaper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    The problem of column subset selection has recently attracted a large body of research, with feature selection serving as one obvious and important application. Among the techniques that have been applied to solve this problem, the greedy algorithm has been shown to be quite effective in practice. However, theoretical guarantees on its performance have not been explored thoroughly, especially in a distributed setting. In this paper, we study the greedy algorithm for the column subset selection problem from a theoretical and empirical perspective and show its effectiveness in a distributed setting. In particular, we provide an improved approximation guarantee for the greedy algorithm which we show is tight up to a constant factor, and present the first distributed implementation with provable approximation factors. We use the idea of randomized composable core-sets, developed recently in the context of submodular maximization. Finally, we validate the effectiveness of this distributed algorithm via an empirical study.
  • 10:37 – Efficient Private Empirical Risk Minimization for High-dimensional Learning Shiva Prasad Kasiviswanathan Samsung Research America, Hongxia Jin Samsung Research AmericaPaper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    Dimensionality reduction is a popular approach for dealing with high dimensional data that leads to substantial computational savings. Random projections are a simple and effective method for universal dimensionality reduction with rigorous theoretical guarantees. In this paper, we theoretically study the problem of differentially private empirical risk minimization in the projected subspace (compressed domain). Empirical risk minimization (ERM) is a fundamental technique in statistical machine learning that forms the basis for various learning algorithms. Starting from the results of Chaudhuri et al. (NIPS 2009, JMLR 2011), there is a long line of work in designing differentially private algorithms for empirical risk minimization problems that operate in the original data space. We ask: is it possible to design differentially private algorithms with small excess risk given access to only projected data?

    In this paper, we answer this question in affirmative, by showing that for the class of generalized linear functions, we can obtain excess risk bounds of O(w(Theta)^{2/3}/n^{1/3}) under eps-differential privacy, and O((w(Theta)/n)^{1/2}) under (eps,delta)-differential privacy, given only the projected data and the projection matrix. Here n is the sample size and w(Theta) is the Gaussian width of the parameter space that we optimize over. Our strategy is based on adding noise for privacy in the projected subspace and then lifting the solution to original space by using high-dimensional estimation techniques. A simple consequence of these results is that, for a large class of ERM problems, in the traditional setting (i.e., with access to the original data), under eps-differential privacy, we improve the worst-case risk bounds of Bassily et al. (FOCS 2014).

  • 10:54 – Binary embeddings with structured hashed projections Anna Choromanska Courant Institute, NYU, Krzysztof Choromanski Google Research NYC, Mariusz Bojarski NVIDIA, Tony Jebara Columbia, Sanjiv Kumar , Yann Paper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    We consider the hashing mechanism for constructing
    binary embeddings, that involves
    pseudo-random projections followed by nonlinear
    (sign function) mappings. The pseudorandom
    projection is described by a matrix,
    where not all entries are independent random
    variables but instead a fixed “budget of randomness”
    is distributed across the matrix. Such matrices
    can be efficiently stored in sub-quadratic or
    even linear space, provide reduction in randomness
    usage (i.e. number of required random values),
    and very often lead to computational speed
    ups. We prove several theoretical results showing
    that projections via various structured matrices
    followed by nonlinear mappings accurately preserve
    the angular distance between input high-dimensional
    vectors. To the best of our knowledge,
    these results are the first that give theoretical
    ground for the use of general structured matrices
    in the nonlinear setting. In particular, they
    generalize previous extensions of the Johnson-
    Lindenstrauss lemma and prove the plausibility
    of the approach that was so far only heuristically
    confirmed for some special structured matrices.
    Consequently, we show that many structured
    matrices can be used as an efficient information
    compression mechanism. Our findings
    build a better understanding of certain deep
    architectures, which contain randomly weighted
    and untrained layers, and yet achieve high performance
    on different learning tasks. We empirically
    verify our theoretical findings and show
    the dependence of learning via structured hashed
    projections on the performance of neural network
    as well as nearest neighbor classifier.
  • 11:30 – Differentially Private Policy Evaluation Borja Balle Lancaster University, Maziar Gomrokchi McGill University, Doina Precup McGillPaper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    We present the first differentially private algorithms for reinforcement learning, which apply to the task of evaluating a fixed policy. We establish two approaches for achieving differential privacy, provide a theoretical analysis of the privacy and utility of the two algorithms, and show promising results on simple empirical examples.
  • 11:47 – Learning from Multiway Data: Simple and Efficient Tensor Regression Rose Yu University of Southern Cal, Yan Liu Paper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    Tensor regression has shown to be advantageous in learning tasks with multi-directional relatedness. Given massive multiway data, traditional methods are often too slow to operate on or suffer from memory bottleneck. In this paper, we introduce subsampled tensor projected gradient to solve the problem. Our algorithm is impressively simple and efficient. It is built upon projected gradient method with fast tensor power iterations, leveraging randomized sketching for further acceleration. Theoretical analysis shows that our algorithm converges to the correct solution in fixed number of iterations. The memory requirement grows linearly with the size of the problem. We demonstrate superior empirical performance on both multi-linear multi-task learning and spatio-temporal applications.
  • 12:04 – Low-Rank Matrix Approximation with Stability Dongsheng Li IBM Research – China, Chao Chen , Qin Lv , Junchi Yan , Li Shang , Stephen Chu Paper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    Low-rank matrix approximation has been widely adopted in machine learning applications with sparse data, such as recommender systems. However, the sparsity of the data, incomplete and noisy, introduces challenges to the algorithm stability — small changes in the training data may significantly change the models. As a result, existing low-rank matrix approximation solutions yield low generalization performance, exhibiting high error variance on the training dataset, and minimizing the training error may not guarantee error reduction on the testing dataset. In this paper, we investigate the algorithm stability problem of low-rank matrix approximations. We present a new algorithm design framework, which (1) introduces new optimization objectives to guide stable matrix approximation algorithm design, and (2) solves the optimization problem to obtain stable low-rank approximation solutions with good generalization performance. Experimental results on real-world datasets demonstrate that the proposed work can achieve better prediction accuracy compared with both state-of-the-art low-rank matrix approximation methods and ensemble methods in recommendation task.
  • Wednesday – Monte Carlo Methods

    Session chair: Stefano Ermon

    Location: Empire
  • 10:20 – Interacting Particle Markov Chain Monte Carlo Tom Rainforth University of Oxford, Christian Naesseth Linköping University, Fredrik Lindsten Uppsala University, Brooks Paige University of Oxford, Jan-Willem Vandemeent , Arnaud Doucet University of Oxford, Frank Wood Paper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    We introduce interacting particle Markov chain Monte Carlo (iPMCMC), a PMCMC method based on an interacting pool of standard and conditional sequential Monte Carlo samplers. Like related methods, iPMCMC is a Markov chain Monte Carlo sampler on an extended space. We present empirical results that show significant improvements in mixing rates relative to both non-interacting PMCMC samplers and a single PMCMC sampler with an equivalent memory and computational budget. An additional advantage of the iPMCMC method is that it is suitable for distributed and multi-core architectures.
  • 10:37 – Slice Sampling on Hamiltonian Trajectories Benjamin Bloem-Reddy Columbia University, John Cunningham Columbia UniversityPaper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    Hamiltonian Monte Carlo and slice sampling are amongst the most widely used and studied classes of Markov Chain Monte Carlo samplers. We connect these two methods and present Hamiltonian slice sampling, which allows slice sampling to be carried out along Hamiltonian trajectories, or transformations thereof. Hamiltonian slice sampling clarifies a class of model priors that induce closed-form slice samplers. More pragmatically, inheriting properties of slice samplers, it offers advantages over Hamiltonian Monte Carlo, in that it has fewer tunable hyperparameters and does not require gradient information. We demonstrate the utility of Hamiltonian slice sampling out of the box on problems ranging from Gaussian process regression to Pitman-Yor based mixture models.
  • 10:54 – Robust Monte Carlo Sampling using Riemannian Nos\'{e}-Poincar\'{e} Hamiltonian Dynamics Anirban Roychowdhury , Brian Kulis Boston University, Srinivasan Parthasarathy Paper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    We present a Monte Carlo sampler using a modified Nos\'{e}-Poincar\'{e} Hamiltonian along with Riemannian preconditioning. Hamiltonian Monte Carlo samplers allow better exploration of the state space as opposed to random walk-based methods, but, from a molecular dynamics perspective, may not necessarily provide samples from the canonical ensemble. Nos\'{e}-Hoover samplers rectify that shortcoming, but the resultant dynamics are not Hamiltonian. Furthermore, usage of these algorithms on large real-life datasets necessitates the use of stochastic gradients, which acts as another potentially destabilizing source of noise. In this work, we propose dynamics based on a modified Nos\'{e}-Poincar\'{e} Hamiltonian augmented with Riemannian manifold corrections. The resultant symplectic sampling algorithm samples from the canonical ensemble while using structural cues from the Riemannian preconditioning matrices to efficiently traverse the parameter space. We also propose a stochastic variant using additional terms in the Hamiltonian to correct for the noise from the stochastic gradients.
    We show strong performance of our algorithms on synthetic datasets and high-dimensional Poisson factor analysis-based topic modeling scenarios.
  • 11:30 – Inference Networks for Sequential Monte Carlo in Graphical Models Brooks Paige University of Oxford, Frank Wood Paper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    We introduce a new approach for amortizing inference in directed graphical models
    by learning heuristic approximations to stochastic inverses,
    designed specifically for use as proposal distributions in sequential Monte Carlo methods.
    We describe a procedure for constructing and learning a structured neural network
    which represents an inverse factorization of the graphical model,
    resulting in a conditional density estimator that takes as input
    particular values of the observed random variables, and returns an
    approximation to the distribution of the latent variables.
    This recognition model can be learned offline, independent from
    any particular dataset, prior to performing inference.
    The output of these networks can be used as
    automatically-learned high-quality proposal distributions to
    accelerate sequential Monte Carlo
    across a diverse range of problem settings.
  • 11:47 – Partition Functions from Rao-Blackwellized Tempered Sampling David Carlson Columbia University, Patrick Stinson Columbia University, Ari Pakman Columbia University, Liam Paper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    Partition functions of probability distributions are important quantities for model evaluation and comparisons. We present a new method to compute partition functions of complex and multimodal distributions. Such distributions are often sampled using simulated tempering, which augments the target space with an auxiliary inverse temperature variable. Our method exploits
    the multinomial probability law of the inverse temperatures, and provides estimates of the partition function in terms of a simple quotient of Rao-Blackwellized marginal inverse temperature probability estimates, which are updated while sampling. We show that the method has interesting connections with several alternative popular methods, and offers some significant advantages. In particular, we empirically find that the new method provides more accurate estimates than Annealed Importance Sampling when calculating partition functions of large Restricted Boltzmann Machines (RBM);
    moreover, the method is sufficiently accurate to track training and validation log-likelihoods during learning of RBMs, at minimal computational cost.
  • 12:04 – Stochastic Quasi-Newton Langevin Monte Carlo Umut Simsekli Telecom ParisTech, Roland Badeau , Taylan Cemgil , Gaël Richard Paper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    Recently, Stochastic Gradient Markov Chain Monte Carlo (SG-MCMC) methods have been proposed for scaling up Monte Carlo computations to large data problems. Whilst these approaches have proven useful in many applications, vanilla SG-MCMC might suffer from poor mixing rates when random variables exhibit strong couplings under the target densities or big scale differences. In this study, we propose a novel SG-MCMC method that takes the local geometry into account by using ideas from Quasi-Newton optimization methods. These second order methods directly approximate the inverse Hessian by using a limited history of samples and their gradients. Our method uses dense approximations of the inverse Hessian while keeping the time and memory complexities linear with the dimension of the problem. We provide a formal theoretical analysis where we show that the proposed method is asymptotically unbiased and consistent with the posterior expectations. We illustrate the effectiveness of the approach on both synthetic and real datasets. Our experiments on two challenging applications show that our method achieves fast convergence rates similar to Riemannian approaches while at the same time having low computational requirements similar to diagonal preconditioning approaches.
  • Wednesday – Crowdsourcing and Interactive Learning

    Session chair: Yisong Yue

    Location: Soho
  • 10:20 – No Oops, You Won’t Do It Again: Mechanisms for Self-correction in Crowdsourcing Nihar Shah UC Berkeley, Dengyong Zhou Microsoft ResearchPaper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    Crowdsourcing is a very popular means of obtaining the large amounts of labeled data that modern machine learning methods require. Although cheap and fast to obtain, crowdsourced labels suffer from significant amounts of error, thereby degrading the performance of downstream machine learning tasks. With the goal of improving the quality of the labeled data, we seek to mitigate the many errors that occur due to silly mistakes or inadvertent errors by crowdsourcing workers. We propose a two-stage setting for crowdsourcing where the worker first answers the questions, and is then allowed to change her answers after looking at a (noisy) reference answer. We mathematically formulate this process and develop mechanisms to incentivize workers to act appropriately. Our mathematical guarantees show that our mechanism incentivizes the workers to answer honestly in both stages, and refrain from answering randomly in the first stage or simply copying in the second. Numerical experiments reveal a significant boost in performance that such “self-correction” can provide when using crowdsourcing to train machine learning algorithms.
  • 10:37 – The Label Complexity of Mixed-Initiative Classifier Training Jina Suh Microsoft, Xiaojin Zhu University of Wisconsin, Saleema Amershi MicrosoftPaper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    Mixed-initiative classifier training, where the human teacher can choose which items to label or to label items chosen by the computer, has enjoyed empirical success but without a rigorous statistical learning theoretical justification. We analyze the label complexity of a simple mixed-initiative training mechanism using teach- ing dimension and active learning. We show that mixed-initiative training is advantageous com- pared to either computer-initiated (represented by active learning) or human-initiated classifier training. The advantage exists across all human teaching abilities, from optimal to completely unhelpful teachers. We further improve classifier training by educating the human teachers. This is done by showing, or explaining, optimal teaching sets to the human teachers. We conduct Mechanical Turk human experiments on two stylistic classifier training tasks to illustrate our approach.
  • 10:54 – The Knowledge Gradient for Sequential Decision Making with Stochastic Binary Feedbacks Yingfei Wang Princeton University, Chu Wang , Warren Powell Paper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    We consider the problem of sequentially making decisions that are rewarded by “successes” and “failures” which can be predicted through an unknown relationship that depends on a partially controllable vector of attributes for each instance. The learner takes an active role in selecting samples from the instance pool. The goal is to maximize the probability of success, either after the offline training phase or minimizing regret in online learning. Our problem is motivated by real-world applications where observations are time consuming and/or expensive. With the adaptation of an online Bayesian linear classifier, we develop a knowledge-gradient type policy to guide the experiment by maximizing the expected value of information of labeling each alternative, in order to reduce the number of expensive physical experiments. We provide a finite-time analysis of the estimated error and demonstrate the performance of the proposed algorithm on both synthetic problems and benchmark UCI datasets.
  • 11:30 – Estimating Accuracy from Unlabeled Data: A Bayesian Approach Emmanouil Antonios Platanios Carnegie Mellon University, Avinava Dubey Carnegie Mellon University, Tom Mitchell Carnegie Mellon UniversityPaper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    We consider the question of how unlabeled data can be used to estimate the true accuracy of learned classifiers, and the related question of how outputs from several classifiers performing the same task can be combined based on their estimated accuracies. To answer these questions, we first present a simple graphical model that performs well in practice. We then provide two nonparametric extensions to it that improve its performance. Experiments on two real-world data sets produce accuracy estimates within a few percent of the true accuracy, using solely unlabeled data. Our models also outperform existing state-of-the-art solutions in both estimating accuracies, and combining multiple classifier outputs.
  • 11:47 – Actively Learning Hemimetrics with Applications to Eliciting User Preferences Adish Singla , Sebastian Tschiatschek ETH Zurich, Andreas Krause Paper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    Motivated by an application of eliciting users’ preferences, we investigate the problem of learning hemimetrics, i.e., pairwise distances among a set of $n$ items that satisfy triangle inequalities and non-negativity constraints. In our application, the (asymmetric) distances quantify private costs a user incurs when substituting one item by another. We aim to learn these distances (costs) by asking the users whether they are willing to switch from one item to another for a given incentive offer. Without exploiting structural constraints of the hemimetric polytope, learning the distances between each pair of items requires $\Theta(n^2)$ queries. We propose an active learning algorithm that substantially reduces this sample complexity by exploiting the structural constraints on the version space of hemimetrics. Our proposed algorithm achieves provably-optimal sample complexity for various instances of the task. For example, when the items are embedded into $K$ tight clusters, the sample complexity of our algorithm reduces to $O(n K)$. Extensive experiments on a restaurant recommendation data set support the conclusions of our theoretical analysis.
  • 12:04 – Optimality of Belief Propagation for Crowdsourced Classification Jungseul Ok KAIST, Sewoong Oh UIUC, Jinwoo Shin KAIST, Yung Yi KAISTPaper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    Crowdsourcing systems are popular for solving large-scale labelling tasks with low-paid (or even non-paid) workers. We study the problem of recovering the true labels from noisy crowdsourced labels under the popular Dawid-Skene model. To address this inference problem, several algorithms have recently been proposed, but the best known guarantee is still significantly larger than the fundamental limit. We close this gap under a simple but canonical scenario where each worker is assigned at most two tasks. In particular, we introduce a tighter lower bound on the fundamental limit and prove that Belief Propagation (BP) exactly matches this lower bound. The guaranteed optimality of BP is the strongest in the sense that it is information-theoretically impossible for any other algorithm to correctly la- bel a larger fraction of the tasks. In the general setting, when more than two tasks are assigned to each worker, we establish the dominance result on BP that it outperforms other existing algorithms with known provable guarantees. Experimental results suggest that BP is close to optimal for all regimes considered, while existing state-of-the-art algorithms exhibit suboptimal performances.
  • Wednesday – Learning Theory

    Session chair: Alina Beygelzimer

    Location: Liberty
  • 10:20 – Improved SVRG for Non-Strongly-Convex or Sum-of-Non-Convex Objectives Zeyuan Allen-Zhu Princeton University, Yang Yuan CornellPaper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    Many classical algorithms are found until several years later to outlive the confines in which they were conceived, and continue to be relevant in unforeseen settings. In this paper, we show that SVRG is one such method: being originally designed for strongly convex objectives, it is also very robust in non-strongly convex or sum-of-non-convex settings.

    More precisely, we provide new analysis to improve the state-of-the-art running times in both settings by either applying SVRG or its novel variant. Since non-strongly convex objectives include important examples such as Lasso or logistic regression, and sum-of-non-convex objectives include famous examples such as stochastic PCA and is even believed to be related to training deep neural nets, our results also imply better performances in these applications.

  • 10:37 – Variance Reduction for Faster Non-Convex Optimization Zeyuan Allen-Zhu Princeton University, Elad Hazan Princeton UniversityPaper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    We consider the fundamental problem in non-convex optimization of efficiently reaching a stationary point. In contrast to the convex case, in the long history of this basic problem, the only known theoretical results on first-order non-convex optimization remain to be full gradient descent that converges in $O(1/\varepsilon)$ iterations for smooth objectives, and stochastic gradient descent that converges in $O(1/\varepsilon^2)$ iterations for objectives that are sum of smooth functions.

    We provide the first improvement in this line of research. Our result is based on the variance reduction trick recently introduced to convex optimization, as well as a brand new analysis of variance reduction that is suitable for non-convex optimization. For objectives that are sum of smooth functions, our first-order minibatch stochastic method converges with an $O(1/\varepsilon)$ rate, and is faster than full gradient descent by $\Omega(n^{1/3})$.

    We demonstrate the effectiveness of our methods on empirical risk minimizations with non-convex loss functions and training neural nets.

  • 10:54 – Even Faster Accelerated Coordinate Descent Using Non-Uniform Sampling Zeyuan Allen-Zhu Princeton University, Zheng Qu The University of Hong Kong, Peter Richtarik , Yang Yuan CornellPaper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    Accelerated coordinate descent is widely used in optimization due to its cheap per-iteration cost and scalability to large-scale problems. Up to a primal-dual transformation, it is also the same as accelerated stochastic gradient descent that is one of the central methods used in machine learning.

    In this paper, we improve the best known running time of accelerated coordinate descent by a factor up to $\sqrt{n}$. Our improvement is based on a clean, novel non-uniform sampling that selects each coordinate with a probability proportional to the square root of its smoothness parameter. Our proof technique also deviates from the classical estimation sequence technique used in prior work. Our speed-up applies to important problems such as empirical risk minimization and solving linear systems, both in theory and in practice.

  • 11:30 – False Discovery Rate Control and Statistical Quality Assessment of Annotators in Crowdsourced Ranking QianQian Xu IIE, CAS, Jiechao Xiong Peking University, Xiaochun Cao Institute of information engineering, CAS, Yuan Yao Peking UniversityPaper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    With the rapid growth of crowdsourcing platforms it has become easy and relatively inexpensive to collect a dataset labeled by multiple annotators in a short amount of time. However due to the lack of control over the quality of the annotators, some abnormal annotators maybe affected by position bias which can potentially degrade the quality of the final consensus labels. In this paper we introduce a statistical framework to model and detect annotator’s position bias in order to control the false discovery rate (FDR) without a prior knowledge on the amount of biased annotators — the expected fraction of false discoveries among all discoveries being not too high, in order to assure that most of the discoveries are indeed true and replicable. The key technical development relies on some new knockoff filters adapted to our problem and new algorithms based on the Inverse Scale Space dynamics whose discretization is potentially suitable for large scale crowdsourcing data analysis. Our studies are supported by experiments with both simulated examples and real-world data. The proposed framework provides us a useful tool for quantitatively studying annotator’s abnormal behavior in crowdsourcing data arising from machine learning, sociology, computer vision, multimedia, etc.
  • 11:47 – On the Power and Limits of Distance-Based Learning Periklis Papakonstantinou Rutgers University , Jia Xu Chinese Academy of Sciences, Guang Yang ICT, BeijingPaper | Reviews | Rebuttal | Poster session on tuesday afternoon 3pm-7pm | Abstract
    We initiate the study of low-distortion finite metric embeddings in multi-class (and multi-label) classification where (i) both the space of input instances and the space of output classes have combinatorial metric structure and (ii) the concepts we wish to learn are low-distortion embeddings. We develop new geometric techniques and prove strong learning lower bounds. These provable limits hold even when we allow learners and classifiers to get advice by one or more experts. Our study overwhelmingly indicates that post-geometry assumptions are necessary in multi-class classification, as in natural language processing (NLP). Technically, the mathematical tools we developed in this work could be of independent interest to NLP. To the best of our knowledge, this is the first work which formally studies classification problems in combinatorial spaces. and where the concepts are low-distortion embeddings.
  • 12:04 – Train faster, generalize better: Stability of stochastic gradient descent Moritz Hardt Google, Ben Recht Berkeley, Yoram Paper | Reviews | Rebuttal | Poster session on tuesday morning 10am-1pm | Abstract
    We show that parametric models trained by a stochastic gradient method (SGM)
    with few iterations have vanishing generalization error. We prove our results
    by arguing that SGM is algorithmically stable in the sense of Bousquet and
    Elisseeff. Our analysis only employs elementary tools from convex and
    continuous optimization. We derive stability bounds for both convex and
    non-convex optimization under standard Lipschitz and smoothness assumptions.

    Applying our results to the convex case, we provide new insights for why
    multiple epochs of stochastic gradient methods generalize well in practice.
    In the non-convex case, we give a new interpretation of common practices in
    neural networks, and formally show that popular techniques for training large
    deep models are indeed stability-promoting. Our findings conceptually
    underscore the importance of reducing training time beyond its obvious

  • Wednesday – Supervised Learning

    Session chair: Csaba Szepesvari

    Location: Ballroom 3+4
  • 03:40 – Sparse Nonlinear Regression: Parameter Estimation Zhuoran Yang Princeton University, Zhaoran Wang Princeton University, Han , Yonina Eldar Technion, Tong Zhang Paper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    We study parameter estimation for sparse nonlinear regression. More specifically, we assume the data are given by $y = f( \xb^\top \bbeta^* ) + \epsilon$, where $f$ is nonlinear. To recover $\bbetas$, we propose an $\ell_1$-regularized least-squares estimator. Unlike classical linear regression, the corresponding optimization problem is nonconvex because of the nonlinearity of $f$. In spite of the nonconvexity, we prove that under mild conditions, every stationary point of the objective enjoys an optimal statistical rate of convergence. Detailed numerical results are provided to back up our theory.
  • 03:57 – Polynomial Networks and Factorization Machines: New Insights and Efficient Training Algorithms Mathieu Blondel NTT, Masakazu Ishihata NTT Communication Science Labo, Akinori Fujino NTT, Naonori Ueda Paper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    Polynomial networks and factorization machines are two recently-proposed models that can efficiently use feature interactions in classification and regression tasks. In this paper, we revisit both models from a unified perspective. Based on this new view, we study the properties of both models and propose new efficient training algorithms. Key to our approach is to cast parameter learning as a low-rank symmetric tensor estimation problem, which we solve by multi-convex optimization. We demonstrate our approach on regression and recommender system tasks.
  • 04:14 – Hyperparameter optimization with approximate gradient Fabian Pedregosa INRIAPaper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    Most models in machine learning contain at least one hyperparameter to control for model complexity. Choosing an appropriate set of hyperparameters is both crucial in terms of model accuracy and computationally challenging. In this work we propose an algorithm for the optimization of continuous hyperparameters using inexact gradient information. An advantage of this method is that hyperparameters can be updated before model parameters have fully converged. We also give sufficient conditions for the global convergence of this method, based on regularity conditions of the involved functions and summability of errors.
    Finally, we validate the empirical performance of this method on the estimation of regularization constants of L2-regularized logistic regression and kernel Ridge regression. Empirical benchmarks indicate that our approach is highly competitive with respect to state of the art methods.
  • Wednesday – Kernel Methods

    Session chair: Marius Kloft

    Location: Marquis
  • 03:40 – DR-ABC: Approximate Bayesian Computation with Kernel-Based Distribution Regression Jovana Mitrovic University of Oxford, Dino Sejdinovic University of Oxford, Yee-Whye Teh OxfordPaper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    Performing exact posterior inference in complex generative models is often difficult or impossible due to an expensive to evaluate or intractable likelihood function. Approximate Bayesian computation (ABC) is an inference framework that constructs an approximation to the true likelihood based on the similarity between the observed and simulated data as measured by a predefined set of summary statistics. Although the choice of informative problem-specific summary statistics crucially influences the quality of the likelihood approximation and hence also the quality of the posterior sample in ABC, there are only few principled general-purpose approaches to the selection or construction of such summary statistics. In this paper, we develop a novel framework for solving this problem. We model the functional relationship between the data and the optimal choice (with respect to a loss function) of summary statistics using kernel-based distribution regression. Furthermore, we extend our approach
    to incorporate kernel-based regression from conditional distributions, thus appropriately taking into account the specific structure of the posited generative model. We show that our approach can be implemented in a computationally and statistically efficient way using the random Fourier features framework for large-scale kernel learning. In addition to that, our framework outperforms related methods by a large margin on toy and real-world data, including hierarchical and time series models.
  • 03:57 – Persistence weighted Gaussian kernel for topological data analysis Genki Kusano Tohoku University, Yasuaki Hiraoka , Kenji Fukumizu The Institute of Statistical MathematicsPaper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    Topological data analysis (TDA) is an emerging mathematical concept for characterizing shapes in complex data. In TDA, persistence diagrams are widely recognized as a useful descriptor of data, and can distinguish robust and noisy topological properties. This paper proposes a kernel method on persistence diagrams to develop a statistical framework in TDA. The proposed kernel satisfies the stability property and provides explicit control on the effect of persistence. Furthermore, the method allows a fast approximation technique. The method is applied into practical data on proteins and oxide glasses, and the results show the advantage of our method compared to other relevant methods on persistence diagrams.
  • 04:14 – Discriminative Embeddings of Latent Variable Models for Structured Data Hanjun Dai Georgia Tech, Bo Dai Georgia Tech, Le Song GatechPaper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    Kernel classifiers and regressors designed for structured data, such as sequences, trees and graphs, have significantly advanced a number of interdisciplinary areas such as computational biology and drug design. Typically, kernels are designed beforehand for a data type which either exploit statistics of the structures or make use of probabilistic generative models, and then a discriminative classifier is learned based on the kernels via convex optimization. However, such an elegant two-stage approach also limited kernel methods from scaling up to millions of data points, and exploiting discriminative information to learn feature representations.

    We propose, structure2vec, an effective and scalable approach for structured data representation based on the idea of embedding latent variable models into feature spaces, and learning such feature spaces using discriminative information. Interestingly, structure2vec extracts features by performing a sequence of function mappings in a way similar to graphical model inference procedures, such as mean field and belief propagation. In applications involving millions of data points, we showed that structure2vec runs 2 times faster, produces models which are 10,000 times smaller, while at the same time achieving the state-of-the-art predictive performance.

  • Wednesday – Matrix Factorization and Related Topics

    Session chair: Stefanie Jegelka

    Location: Lyceum
  • 03:40 – Recycling Randomness with Structure for Sublinear time Kernel Expansions Krzysztof Choromanski Google Research NYC, Vikas Sindhwani Google ResearchPaper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    We propose a scheme for recycling Gaussian random
    vectors into structured matrices to ap-
    proximate various kernel functions in sublin-
    ear time via random embeddings. Our frame-
    work includes the Fastfood construction of Le
    et al. (2013) as a special case, but also ex-
    tends to Circulant, Toeplitz and Hankel matri-
    ces, and the broader family of structured matri-
    ces that are characterized by the concept of low-
    displacement rank. We introduce notions of co-
    herence and graph-theoretic structural constants
    that control the approximation quality, and prove
    unbiasedness and low-variance properties of ran-
    dom feature maps that arise within our frame-
    work. For the case of low-displacement matri-
    ces, we show how the degree of structure and
    randomness can be controlled to reduce statis-
    tical variance at the cost of increased computa-
    tion and storage requirements. Empirical results
    strongly support our theory and justify the use of
    a broader family of structured matrices for scal-
    ing up kernel methods using random features.
  • 03:57 – Optimal Classification with Multivariate Losses Nagarajan Natarajan Microsoft Research India, Oluwasanmi Koyejo Stanford University & University of Illinois at Urbana Champaign, Pradeep Ravikumar UT Austin, Inderjit Paper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    Multivariate loss functions are extensively employed in several prediction tasks arising in Information Retrieval. Often, the goal in the tasks is to minimize expected loss when retrieving relevant items from a presented set of items, where the expectation is with respect to the joint distribution over item sets.
    Our key result is that for most multivariate losses, the expected loss is provably optimized by sorting the items by the conditional probability of label being positive and then selecting top $k$ items. Such a result was previously known only for the $F$-measure. Leveraging on the optimality characterization, we give an algorithm for estimating optimal predictions in practice with runtime quadratic in size of item sets for many losses. We provide empirical results on benchmark datasets, comparing the proposed algorithm to state-of-the-art methods for optimizing multivariate losses.
  • 04:14 – Sparse Parameter Recovery from Aggregated Data Avradeep Bhowmik University of Texas at Austin, Joydeep , Oluwasanmi Koyejo Stanford University & University of Illinois at Urbana ChampaignPaper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    Data aggregation is becoming an increasingly common technique for sharing sensitive information, and for reducing data size when storage and/or communication costs are high. Aggregate quantities such as group-average are a form of semi-supervision as they do not directly provide information of individual values, but despite their wide-spread use, prior literature on learning individual-level models from aggregated data is extremely limited. This paper investigates the effect of data aggregation on parameter recovery for a sparse linear model, when known results are no longer applicable. In particular, we consider a scenario where the data are collected into groups e.g. aggregated patient records, and first-order empirical moments are available only at the group level. Despite this obfuscation of individual data values, we can show that the true parameter is recoverable with high probability using these aggregates when the collection of true group moments is an incoherent matrix, and the empirical moment estimates have been computed from a sufficiently large number of samples. To the best of our knowledge, ours are the first results on structured parameter recovery using only aggregated data. Experimental results on synthetic data are provided in support of these theoretical claims. We also show that parameter estimation from aggregated data approaches the accuracy of parameter estimation obtainable from non-aggregated or “individual” samples, when applied to two real world healthcare applications- predictive modeling of CMS Medicare reimbursement claims, and modeling of Texas State healthcare charges.
  • Wednesday – Privacy, Anonymity, and Security

    Session chair: Gal Chechik

    Location: Empire
  • 03:40 – Learning privately from multiparty data Jihun Hamm , Yingjun Cao UC-San Diego, Mikhail Belkin Paper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    Learning a classifier from private data distributed across multiple parties is an important problem that has many potential applications. How can we build an accurate and differentially private global classifier by combining locally-trained classifiers from different parties, without access to any party’s private data? We propose to transfer the ‘knowledge’ of the local classifier ensemble by first creating labeled data from auxiliary unlabeled data, and then train a global differentially private classifier. We show that majority voting is too sensitive and therefore propose a new risk weighted by class probabilities estimated from the ensemble. Relative to a non-private solution, our private solution has a generalization error bounded by O(\epsilon^{-2} M^{-2}). This allows strong privacy without performance loss when the number of participating parties M is large, such as in crowdsensing applications. We demonstrate the performance of our framework with realistic tasks of activity recognition, network intrusion detection, and malicious URL detection.
  • 03:57 – Differentially Private Chi-Squared Hypothesis Testing: Goodness of Fit and Independence Testing Ryan Rogers University of Pennsylvania, Salil Vadhan Harvard University, Hyun Lim UCLA, Marco Gaboardi University at BuffaloPaper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    Hypothesis testing is a useful statistical tool in determining whether a given model should be rejected based on a sample from the population. Sample data may contain sensitive information about individuals, such as medical information. Thus it is important to design statistical tests that guarantee the privacy of subjects in the data. In this work, we study hypothesis testing subject to differential privacy, specifically chi-squared tests for goodness of fit for multinomial data and independence between two categorical variables.
  • 04:14 – Discrete Distribution Estimation under Local Privacy Peter Kairouz UIUC, Keith Bonawitz Google, Daniel Ramage Paper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    The collection and analysis of user data drives improvements in the app and web ecosystems, but comes with risks to privacy. This paper examines discrete distribution estimation under local privacy, a setting wherein service providers can learn the distribution of a categorical statistic of interest without collecting the underlying data. We present new mechanisms, including hashed k-ary Randomized Response (KRR), that empirically meet or exceed the utility of existing mechanisms at all privacy levels. New theoretical results demonstrate the order-optimality of KRR and the existing RAPPOR mechanism at different privacy regimes.
  • Wednesday – Causal Inference

    Session chair: David Sontag

    Location: Soho
  • 03:40 – The Arrow of Time in Multivariate Time Series Stefan Bauer ETH Zurich, Bernhard Schölkopf , Jonas Paper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    We prove that a time series satisfying a (linear)
    multivariate autoregressive moving average (VARMA) model
    satisfies the same model assumption
    in the reversed time direction, too, if
    all innovations are normally distributed. This reversibility breaks down
    if the innovations are non-Gaussian.
    This means that under the assumption of a VARMA process with non-Gaussian noise, the arrow of time becomes detectable.
    Our work thereby provides a theoretic justification of an algorithm that has been used for inferring the direction of video snippets.
    We present a slightly modified practical algorithm that estimates the time direction for a given sample and prove its consistency. We further investigate how the performance of the algorithm depends on sample size, number of dimensions of the time series and the order of the process.
    An application to real world data from economics shows that considering multivariate processes instead of univariate processes can be beneficial for estimating the time direction.
    Our result extends earlier work on univariate time series. It relates to the concept of causal inference, where recent methods exploit non-Gaussianity of the error terms for causal structure learning.
  • 03:57 – Conditional Dependence via Shannon Capacity: Axioms, Estimators and Applications Weihao Gao UIUC, Sreeram Kannan UW Seattle, Sewoong Oh UIUC, Pramod Viswanath UIUCPaper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    We consider axiomatically the problem of estimating the strength of a conditional dependence relationship P_{Y|X} from a random variables X to a random variable Y. This has applications in determining the strength of a known causal relationship, where the strength depends only on the conditional distribution of the effect given the cause (and not on the driving distribution of the cause). Shannon capacity, appropriately regularized, emerges as a natural measure under these axioms. We examine the problem of calculating Shannon capacity from the observed samples
    and propose a novel fixed-k nearest neighbor estimator, and demonstrate its consistency. Finally, we demonstrate an application to single-cell flow-cytometry, where the proposed estimators significantly reduce sample complexity.
  • 04:14 – Learning Granger Causality for Hawkes Processes Hongteng Xu Georgia Tech, Mehrdad Farajtabar , Hongyuan Paper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    Learning Granger causality for general point processes is a very challenging task.
    We propose an effective method learning Granger causality for a special but significant type of point processes — Hawkes processes.
    Focusing on Hawkes processes, we reveal the relationship between Hawkes process’s impact functions and its Granger causality graph.
    Specifically, our model represents impact functions using a series of basis functions and recovers the Granger causality graph via group sparsity of the impact functions’ coefficients.
    We propose an effective learning algorithm combining a maximum likelihood estimator (MLE) with a sparse-group-lasso (SGL) regularizer.
    Additionally, the pairwise similarity between the dimensions of the process is considered when their clustering structure is available.
    We analyze our learning method and discuss the selection of the basis functions.
    Experiments on synthetic data and real-world data show that our method can learn the Granger causality graph and the triggering patterns of Hawkes processes simultaneously.
  • Wednesday – Optimization

    Session chair: Lihong Li

    Location: Liberty
  • 03:40 – Gossip Dual Averaging for Decentralized Optimization of Pairwise Functions Igor Colin , Aurelien Bellet INRIA, Joseph Salmon , Stéphan Clémençon Paper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    In decentralized networks (of sensors, connected objects, etc.), there is an important need for efficient algorithms to optimize a global cost function, for instance to learn a global model from the local data collected by each computing unit.
    In this paper, we address the problem of decentralized minimization of pairwise functions of the data points, where these points are distributed over the nodes of a graph defining the communication topology of the network.
    This general problem finds applications in ranking, distance metric learning and graph inference, among others.
    We propose new gossip algorithms based on dual averaging which aims at solving such problems both in synchronous and asynchronous settings. The proposed framework is flexible enough to deal with constrained and regularized variants of the optimization problem. Our theoretical analysis reveals that the proposed algorithms preserve the convergence rate of centralized dual averaging up to an additive bias term. We present numerical simulations on Area Under the ROC Curve (AUC) maximization and metric learning problems which illustrate the practical interest of our approach.
  • 03:57 – Adaptive Sampling for SGD by Exploiting Side Information Siddharth Gopal Paper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    This paper proposes a new mechanism for sampling training instances for stochastic gradient descent (SGD) methods by exploiting any side-information associated with the instances (for e.g. class-labels) to improve convergence. Previous methods have either relied on sampling from a distribution defined over training instances or from a static distribution that fixed before training. This results in two problems a) any distribution that is set apriori is independent of how the optimization progresses and b) maintaining a distribution over individual instances could be infeasible in large-scale scenarios. In this paper, we exploit the side information associated with the instances to tackle both problems.
    More specifically, we maintain a distribution over classes (instead of individual instances) that is adaptively estimated during the course of optimization to give the maximum reduction in the variance of the gradient. Intuitively, we sample more from those regions in space that have a \textit{larger} gradient contribution.
    Our experiments on highly multiclass datasets show that our proposal converge significantly faster than existing techniques.
  • 04:14 – Mixture Proportion Estimation via Kernel Embeddings of Distributions Harish Ramaswamy , Clayton , Ambuj Paper | Reviews | Rebuttal | Poster session on wednesday morning 10am-1pm | Abstract
    Mixture proportion estimation (MPE) is the problem of estimating the weight of a component distribution in a mixture, given samples from the mixture and component. This problem constitutes a key part in many “weakly supervised learning” problems like learning with positive and unlabelled samples, learning with label noise, anomaly detection and crowdsourcing. While there have been several methods proposed to solve this problem, to the best of our knowledge no efficient algorithm with a proven convergence rate towards the true proportion exists for this problem. We fill this gap by constructing a provably correct algorithm for MPE, and derive convergence rates under certain assumptions on the distribution. Our method is based on embedding distributions onto an RKHS, and implementing it only requires solving a simple convex quadratic programming problem a few times. We run our algorithm on several standard classification datasets, and demonstrate that it performs comparably to or better than other algorithms on most datasets.