Concept

Nombre ordinal

Publications associées (37)

A Method of Moments Estimator for Interacting Particle Systems and their Mean Field Limit

We study the problem of learning unknown parameters in stochastic interacting particle systems with polynomial drift, interaction, and diffusion functions from the path of one single particle in the system. Our estimator is obtained by solving a linear sys ...

Siam Publications2024

Model agnostic methods meta-learn despite misspecifications

Nicolas Henri Bernard Flammarion, Oguz Kaan Yüksel, Etienne Patrice Boursier

Due to its empirical success on few shot classification and reinforcement learning, meta-learning recently received a lot of interest. Meta-learning leverages data from previous tasks to quickly learn a new task, despite limited data. In particular, model ...

2023

Positive Definite Completions and Continuous Graphical Models

Kartik Waghmare

This thesis concerns the theory of positive-definite completions and its mutually beneficial connections to the statistics of function-valued or continuously-indexed random processes, better known as functional data analysis. In particular, it dwells upon ...

EPFL2023

Localization of Electromagnetic Interference Sources Using a Time-Reversal Cavity

Marcos Rubinstein, Mohammad Azadifar, Amirhossein Mostajabi, Hamidreza Karami

In this article, we propose and implement a novel technique to locate electromagnetic interference (EMI) sources using the concept of time-reversal (TR) cavity. We show in an intuitive manner that reflections from the surfaces of a cavity can emulate an in ...

2021

Nearly-Tight and Oblivious Algorithms for Explainable Clustering

Ola Nils Anders Svensson, Adam Teodor Polak, Buddhima Ruwanmini Gamlath Gamlath Ralalage, Xinrui Jia

We study the problem of explainable clustering in the setting first formalized by Dasgupta, Frost, Moshkovitz, and Rashtchian (ICML 2020). A k-clustering is said to be explainable if it is given by a decision tree where each internal node splits data point ...

2021

Comparing crystal structures with symmetry and geometry

Anirudh Raju Natarajan

Measuring the similarity between two arbitrary crystal structures is a common challenge in crystallography and materials science. Although there are an infinite number of ways to mathematically relate two crystal structures, only a few are physically meani ...

2021

On the equation A del u plus (del u)(t) A = G

Bernard Dacorogna

Let Omega subset of R-n be an open set, A is an element of R-nxn and G : Omega -> R-nxn be given. We look for a solution u : Omega -> R-n of the equation A del u + (del u)(t) A = G We also study the associated Dirichlet problem. (C) 2020 Elsevier Ltd. All ...

PERGAMON-ELSEVIER SCIENCE LTD2020

The perceptual relevance of balance, evenness, and entropy in musical rhythms

Steffen Alexander Herff

There is an uncountable number of different ways of characterizing almost any given real-world stimulus. This necessitates finding stimulus features that are perceptually relevant - that is, they have distinct and independent effects on the perception and ...

ELSEVIER2020

Graph-based regularization of inverse problems in imaging

Mattia Rossi

As of today, the extension of the human visual capabilities to machines remains both a cornerstone and an open challenge in the attempt to develop intelligent systems. On the one hand, the development of more and more sophisticated imaging devices, capable ...

EPFL2020

A pathwise approach to the extinction of branching processes with countably many types

Sophie Myriam Hautphenne

We consider the extinction events of Galton-Watson processes with countably infinitely many types. In particular, we construct truncated and augmented Galton-Watson processes with finite but increasing sets of types. A pathwise approach is then used to sho ...

ELSEVIER SCIENCE BV2019

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search