← Search

Jeff A. Bilmes

8 accepted papers

2019

On Mixup Training: Improved Calibration and Predictive Uncertainty for Deep Neural Networks

NeurIPS 2019poster

Mixup~\cite{zhang2017mixup} is a recently proposed method for training deep neural networks where additional samples are generated during training by convexly combining random pairs of images and their associated labels. While simple to implement, it has shown to be a surprisingly effective meth…

2018

Submodular Maximization via Gradient Ascent: The Case of Deep Submodular Functions

NeurIPS 2018poster

We study the problem of maximizing deep submodular functions (DSFs) subject to a matroid constraint. DSFs are an expressive class of submodular functions that include, as strict subfamilies, the facility location, weighted coverage, and sums of concave composed with modular functions. We use a strat…

Cited by 7SourcePDFScholar
2017

Reducing total latency in online real-time inference and decoding via combined context window and model smoothing latencies

ICASSP 2017accepted

Real-time low-latency online inference and decoding in sequential probabilistic models are important in many interactive systems, including automatic speech recognition (ASR) and streaming environments. We study total inference latency (TL) in such systems, the additively combined latency of the inh…

Cited by 0SourceScholar
2015

Mixed Robust/Average Submodular Partitioning: Fast Algorithms, Guarantees, and Applications

NeurIPS 2015poster

We investigate two novel mixed robust/average-case submodular data partitioning problems that we collectively call Submodular Partitioning. These problems generalize purely robust instances of the problem, namely max-min submodular fair allocation (SFA) and \emph{min-max submodular load balancing} (…

Cited by 46SourcePDFScholar
2015

Submodular Hamming Metrics

NeurIPS 2015spotlight

We show that there is a largely unexplored class of functions (positive polymatroids) that can define proper discrete metrics over pairs of binary vectors and that are fairly tractable to optimize over. By exploiting submodularity, we are able to give hardness results and approximation algorithms f…

Cited by 21SourcePDFScholar
2015

Unsupervised learning of acoustic features via deep canonical correlation analysis

ICASSP 2015accepted

It has been previously shown that, when both acoustic and articulatory training data are available, it is possible to improve phonetic recognition accuracy by learning acoustic features from this multi-view data with canonical correlation analysis (CCA). In contrast with previous work based on linea…

Cited by 0SourceScholar