Share This Author
Combining labeled and unlabeled data with co-training
A PAC-style analysis is provided for a problem setting motivated by the task of learning to classify web pages, in which the description of each example can be partitioned into two distinct views, to allow inexpensive unlabeled data to augment, a much smaller set of labeled examples.
Fast Planning Through Planning Graph Analysis
Variational Dropout and the Local Reparameterization Trick
The Variational dropout method is proposed, a generalization of Gaussian dropout, but with a more flexibly parameterized posterior, often leading to better generalization in stochastic gradient variational Bayes.
Selection of Relevant Features and Examples in Machine Learning
Practical privacy: the SuLQ framework
This work considers a statistical database in which a trusted administrator introduces noise to the query responses with the goal of maintaining privacy of individual database entries, and modify the privacy analysis to real-valued functions f and arbitrary row types, greatly improving the bounds on noise required for privacy.
A learning theory approach to non-interactive database privacy
A new notion of data privacy is introduced, which is called distributional privacy, and it is shown that it is strictly stronger than the prevailing privacy notion, differential privacy.
Learning from Labeled and Unlabeled Data using Graph Mincuts
An algorithm based on finding minimum cuts in graphs, that uses pairwise relationships among the examples in order to learn from both labeled and unlabeled data is considered.
Noise-tolerant learning, the parity problem, and the statistical query model
The algorithm runs in polynomial time for the case of parity functions that depend on only the first O(log n log log n) bits of input, which provides the first known instance of an efficient noise-tolerant algorithm for a concept class that is not learnable in the Statistical Query model of Kearns .
Clearing algorithms for barter exchange markets: enabling nationwide kidney exchanges
This work replaces CPLEX as the clearing algorithm of the Alliance for Paired Donation, one of the leading kidney exchanges, and presents the first algorithm capable of clearing these markets on a nationwide scale.
The minimum latency problem
- A. Blum, P. Chalasani, D. Coppersmith, W. Pulleyblank, P. Raghavan, M. Sudan
- Computer ScienceSTOC '94
- 23 May 1994
A tour that minimizes ∑n i=1 `(i), where `( i) is the latency of pi, defined to be the distance traveled before first visiting pi, is constructed.