Efficient learning of smooth probability functions from Bernoulli tests with guarantees

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.

We study the convergence rate of Sinkhorn's algorithm for solving entropy-regularized optimal transport problems when at least one of the probability measures, mu, admits a density over R-d. For a semi-concave cost function bounded by cand a regularization ...

Non-regular or irregular statistical problems are those that do not satisfy a set of standard regularity conditions that allow useful theoretical properties of inferential procedures to be proven. Non-regular problems are prevalent; a classical example is ...

Neurodegenerative diseases, such as Alzheimer's, Parkinson's, and Huntington's, afflict tens of millions of patients worldwide. They are characterized by protein aggregation and progressive neuronal loss, leading to cognitive and motor impairments, and ult ...

Why should we confine land cover classes to rigid and arbitrary definitions? Land cover mapping is a central task in remote sensing image processing, but the rigorous class definitions can sometimes restrict the transferability of annotations between datas ...

This work proposes a decentralized architecture, where individual agents aim at solving a classification problem while observing streaming features of different dimensions and arising from possibly different distributions. In the context of social learning ...

A kernel method for estimating a probability density function from an independent and identically distributed sample drawn from such density is presented. Our estimator is a linear combination of kernel functions, the coefficients of which are determined b ...

Interactions are ubiquitous in our world, spanning from social interactions between human individuals to physical interactions between robots and objects to mechanistic interactions among different components of an intelligent system. Despite their prevale ...

We present a framework for performing regression when both covariate and response are probability distributions on a compact and convex subset of

\R^d

. Our regression model is based on the theory of optimal transport and links the conditional Fr'echet m ...

Deep learning has achieved remarkable success in various challenging tasks such as generating images from natural language or engaging in lengthy conversations with humans. The success in practice stems from the ability to successfully train massive neural ...

Distributed learning is the key for enabling training of modern large-scale machine learning models, through parallelising the learning process. Collaborative learning is essential for learning from privacy-sensitive data that is distributed across various ...

In certain cases of astronomical data analysis, the meaningful physical quantity to extract is the ratio R between two data sets. Examples include the lensing ratio, the interloper rate in spectroscopic redshift samples, and the decay rate of gravitational ...

Higher-order asymptotics provide accurate approximations for use in parametric statistical modelling. In this thesis, we investigate using higher-order approximations in two-specific settings, with a particular emphasis on the tangent exponential model. ...

Epileptic seizure detection and monitoring is critical in healthcare, particularly for individuals requiring continuous oversight. Current methods, primarily based on electroencephalogram (EEG) technologies, face limitations due to their complexity in term ...

In this work, we present, analyze, and implement a class of multilevel Markov chain Monte Carlo(ML-MCMC) algorithms based on independent Metropolis--Hastings proposals for Bayesian inverse problems. In this context, the likelihood function involves solving ...

Since its proposal, quantum computing has made significant strides in various domains. Among the different emerging techniques, Variational Quantum Algorithms (VQAs) have become one of the most promising approaches in the current era, where quantum computa ...

In the field of choice modeling, the availability of ever-larger datasets has the potential to significantly expand our understanding of human behavior, but this prospect is limited by the poor scalability of discrete choice models (DCMs): as sample sizes ...

We consider the problem of efficiently simulating stochastic models of chemical kinetics. The Gillespie stochastic simulation algorithm (SSA) is often used to simulate these models; however, in many scenarios of interest, the computational cost quickly bec ...

This thesis explores the innovative integration of Discrete Choice Modeling (DCM) and Machine Learning (ML), specifically Neural Networks (NN), within the transportation sector. DCM, with its highly interpretable and hand-designed models grounded in robust ...

The variational approach is a cornerstone of computational physics, considering both conventional and quantum computing computational platforms. The variational quantum eigensolver algorithm aims to prepare the ground state of a Hamiltonian exploiting para ...

This thesis studies the origins and consequences of financial crises, and computational techniques to solve continuous-time economic models that explain such crises. The first chapter shows that financial recessions are typically characterised by a large ...

Efficient learning of smooth probability functions from Bernoulli tests with guarantees

Chat with Graph Search

Sharper Exponential Convergence Rates for Sinkhorn's Algorithm in Continuous Settings

Non-regular Inference: Universal Inference and Discrete Profiling

Intelligent and Self-Driving Microscopy of Protein Aggregation in Neurodegenerative Diseases

Learning transferable land cover semantics for open vocabulary interactions with remote sensing images

Learning From Heterogeneous Data Based on Social Interactions Over Graphs

Density estimation in RKHS with application to Korobov spaces in high dimensions

Learning Robust and Adaptive Representations: from Interactions, for Interactions

Distributional Regression and Autoregression via Optimal Transport

A Theory of Finite-Width Neural Networks: Generalization, Scaling Laws, and the Loss Landscape

Optimization Algorithms for Decentralized, Distributed and Collaborative Machine Learning

An Unbiased Method of Measuring the Ratio of Two Data Sets

Higher Order Asymptotics: Applications to Satellite Conjunction and Boundary Problems

Distributed Machine Learning Targeting Embedded Systems for Epilepsy Detection

Analysis of a Class of Multilevel Markov Chain Monte Carlo Algorithms Based on Independent Metropolis–Hastings

Quantum Variational Algorithms: Exploring Applications and Potentials Amid Trainability and Classical Simulability Limitations

Stochastic adaptive resampling for the estimation of discrete choice models

A hybrid tau-leap for simulating chemical kinetics with applications to parameter estimation

Bridging Discrete Choice Modeling and Neural Networks: Unifying Statistical Rigor and Predictive Power

Phenomenological theory of variational quantum ground-state preparation

Essays in macro-finance and deep learning