Publication

Sublinear Bounds on the Distinguishing Advantage for Multiple Samples

Related publications (125)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Chemical shift correlations in disordered solids

David Lyndon Emsley

We show how two-dimensional chemical shift conditional probability distributions can be extracted from experimental NMR correlation spectra of disordered solids. We show that transverse dephasing times are of central importance in determining the resolutio ...

AMER CHEMICAL SOC2005

Statistical cryptanalysis of block ciphers

Pascal Junod

Since the development of cryptology in the industrial and academic worlds in the seventies, public knowledge and expertise have grown in a tremendous way, notably because of the increasing, nowadays almost ubiquitous, presence of electronic communication m ...

EPFL2005

Perfect Simulations for Random Trip Mobility Models

Jean-Yves Le Boudec, Milan Vojnovic, Santashil Palchaudhuri

The random trip model was recently proposed as a generic mobility model that contains many particular mo-bility models, including the widely-known random waypoint and random walks, and accommodates more realistic sce-narios. The probability distribution of ...

2005

Gradient estimates of return distributions

Samy Bengio, Christos Dimitrakakis

We present a general method for maintaining estimates of the distribution of parameters in arbitrary models. This is then applied to the estimation of probability distributions over actions in value-based reinforcement learning. While this approach is simi ...

2005

Boosting word error rates

Samy Bengio, Christos Dimitrakakis

We apply boosting techniques to the problem of word error rate minimisation in speech recognition. This is achieved through a new definition of sample error for boosting and a training procedure for hidden Markov models. For this purpose we define a sample ...

2005

Boosting word error rates

Samy Bengio, Christos Dimitrakakis

2005

Estimation of value of travel-time savings using Mixed Logit models

Michel Bierlaire

In this paper, we discuss some of the issues that arise with the computation of the implied value of travel-time savings in the case of discrete choice models allowing for random taste heterogeneity. We specifically look at the case of models producing a n ...

2005

Single potential electrophoresis on-chip using Pressure Pulse Injection

Martinus Gijs, Frédéric Lacharme

We propose two new injection techniques for use in electrophoresis microchips, which we call 舖Front Gate Pressure Injection舗 and 舖Back Gate Pressure Injection舗. Both techniques enable a controlled and variable size sample introduction with reduced bias com ...

2005

Estimates of Parameter Distributions for Optimal Action Selection

Samy Bengio, Christos Dimitrakakis

We present a general method for maintaining estimates of the distribution of parameters in arbitrary models. This is then applied to the estimation of probability distribution over actions in value-based reinforcement learning. While this approach is simil ...

IDIAP2004

Invariances in Kernel Methods: From Samples to Objects

Samy Bengio, Alexei Pozdnoukhov

This paper presents a general method for incorporating prior knowledge into kernel methods such as Support Vector Machines. It applies when the prior knowledge can be formalized by the description of an object around each sample of the training set, assumi ...

IDIAP2004