Publications associées à Evaluation of a probabilistic approach to learn and reproduce gestures by imitation

On distributional autoregression and iterated transportation

We consider the problem of defining and fitting models of autoregressive time series of probability distributions on a compact interval of Double-struck capital R. An order-1 autoregressive model in this context is to be understood as a Markov chain, where ...

Wiley2024

Novel Methods For Detection And Analysis Of Atypical Aspects In Speech

Julian David Fritsch

Atypical aspects in speech concern speech that deviates from what is commonly considered normal or healthy. In this thesis, we propose novel methods for detection and analysis of these aspects, e.g. to monitor the temporary state of a speaker, diseases tha ...

EPFL2023

Multi-robot task allocation for safe planning against stochastic hazard dynamics

Orcun Karaca, Maryam Kamgarpour

We address multi-robot safe mission planning in uncertain dynamic environments. This problem arises in several applications including safety-critical exploration, surveillance, and emergency rescue missions. Computation of a multi-robot optimal control pol ...

IEEE2023

Quantitative Methods for Omnichannel Decision-Making

Andrey Vasilyev

Omnichannel retail has emerged as the new standard in today's commerce landscape, with retailers integrating their physical and online channels to enhance the customer shopping experience. However, such integration presents significant challenges for retai ...

EPFL2023

Hidden Markov Modeling Over Graphs

Ali H. Sayed, Stefan Vlaski, Virginia Bordignon, Mert Kayaalp

This work proposes a multi-agent filtering algorithm over graphs for finite-state hidden Markov models (HMMs), which can be used for sequential state estimation or for tracking opinion formation over dynamic social networks. We show that the difference fro ...

IEEE2022

A note on universal inference

Anthony Christopher Davison, Timmy Rong Tian Tse

Universal inference enables the construction of confidence intervals and tests without regularity conditions by splitting the data into two parts and appealing to Markov's inequality. Previous investigations have shown that the cost of this generality is a ...

WILEY2022

Product of experts for robot learning from demonstration

Emmanuel Pignat

Adaptability and ease of programming are key features necessary for a wider spread of robotics in factories and everyday assistance. Learning from demonstration (LfD) is an approach to address this problem. It aims to develop algorithms and interfaces such ...

EPFL2021

Predictive user-based relocation through incentives in one-way car-sharing systems

Nikolaos Geroliminis, Patrick Stefan Adriaan Stokkink

Car-sharing systems are an attractive alternative to private vehicles due to their benefits in terms of mobility and sustainability. However, the distribution of vehicles throughout the network in one-way systems is disturbed due to asymmetry and stochasti ...

2021

Predicting learners' effortful behaviour in adaptive assessment using multimodal data

Kshitij Sharma, Jennifer Kaitlyn Olsen

Many factors influence learners' performance on an activity beyond the knowledge required. Learners' on-task effort has been acknowledged for strongly relating to their educational outcomes, reflecting how actively they are engaged in that activity. Howeve ...

ASSOC COMPUTING MACHINERY2020

On quantifying the quality of acoustic models in hybrid DNN-HMM ASR

Hervé Bourlard, Afsaneh Asaei, Pranay Dighe

We propose an information theoretic framework for quantitative assessment of acoustic models used in hidden Markov model (HMM) based automatic speech recognition (ASR). The HMM backend expects that (i) the acoustic model yields accurate state conditional e ...

ELSEVIER2020

Multilingual Training and Adaptation in Speech Recognition

Sibo Tong

State-of-the-art acoustic models for Automatic Speech Recognition (ASR) are based on Hidden Markov Models (HMM) and Deep Neural Networks (DNN) and often require thousands of hours of transcribed speech data during training. Therefore, building multilingual ...

EPFL2020

Inference methods for the study of interacting biological oscillators in single-cells

Colas Noé Droin

Biological oscillators are pervasive in biology, covering all aspects of life from enzyme kinetics reactions to population dynamics. Although their behaviour has been intensively studied in the last decades, the recent advances of high-throughput experimen ...

EPFL2020

Geometric ergodicity for some space-time max-stable Markov chains

Erwan Fabrice Koch

Max-stable processes are central models for spatial extremes. In this paper, we focus on some space-time max-stable models introduced in Embrechts et al. (2016). The processes considered induce discrete-time Markov chains taking values in the space of cont ...

ELSEVIER SCIENCE BV2019

Unsupervised algorithm for disaggregating low-sampling-rate electricity consumption of households

Christophe Ballif, Lionel Benjamin Bloch, Nicolas Würsch, Jordan Holweger, Marina Dorokhova

Non-intrusive load monitoring (NILM) has been extensively researched over the last decade. The objective of NILM is to identify the power consumption of individual appliances and to detect when particular devices are on or off from measuring the power cons ...

2019

Low-rank and sparse subspace modeling of speech for DNN based acoustic modeling

Hervé Bourlard, Afsaneh Asaei, Pranay Dighe

Towards the goal of improving acoustic modeling for automatic speech recognition (ASR), this work investigates the modeling of senone subspaces in deep neural network (DNN) posteriors using low-rank and sparse modeling approaches. While DNN posteriors are ...

ELSEVIER SCIENCE BV2019

Multigrid Methods Combined With Low-Rank Approximation For Tensor-Structured Markov Chains

Daniel Kressner, Francisco Santos Paredes Quartin de Macedo

Markov chains that describe interacting subsystems suffer from state space explosion but lead to highly structured matrices. In this work, we propose a novel tensor-based algorithm to address such tensor-structured Markov chains. Our algorithm combines a t ...

2018

Efficient Learning from Comparisons

Lucas Maystre

Humans are comparison machines: comparing and choosing an item among a set of alternatives (such as objects or concepts) is arguably one of the most natural ways for us to express our preferences and opinions. In many applications, the analysis of data con ...

EPFL2018

Low-rank tensor methods for large Markov chains and forward feature selection methods

Francisco Santos Paredes Quartin de Macedo

In the first part of this thesis, we present and compare several approaches for the determination of the steady-state of large-scale Markov chains with an underlying low-rank tensor structure. Such structure is, in our context of interest, associated with ...

EPFL2018

Learning Stable Task Sequences from Demonstration with Linear Parameter Varying Systems and Hidden Markov Models

Aude Billard, José Ramon Medina Hernandez

The problem of acquiring multiple tasks from demonstration is typi- cally divided in two sequential processes: (1) the segmentation or identification of different subgoals/subtasks and (2) a separate learning process that parameterizes a control policy for ...

robot-learning2017

Indoor Scene Parsing with Instance Segmentation, Semantic Labeling and Support Relationship Inference

Mathieu Salzmann, Wei Zhuo

Over the years, indoor scene parsing has attracted a growing interest in the computer vision community. Existing methods have typically focused on diverse subtasks of this challenging problem. In particular, while some of them aim at segmenting the image i ...

Ieee2017