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

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 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 ...

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 ...

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 ...

We find all polyhedral graphs such that their complements are still polyhedral. These turn out to be all self-complementary. ...

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 ...

In this paper we introduce and study the STREAMINGCYCLES problem, a random order streaming version of the Boolean Hidden Hypermatching problem that has been instrumental in streaming lower bounds over the past decade. In this problem the edges of a graph G ...

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 ...

Deriving the time-dependent expected reward function associated with a continuous-time Markov chain involves the computation of its transient deviation matrix. In this paper we focus on the special case of a finite quasi-birth-and-death (QBD) process, moti ...

This thesis is devoted to the construction, analysis, and implementation of two types of hierarchical Markov Chain Monte Carlo (MCMC) methods for the solution of large-scale Bayesian Inverse Problems (BIP). The first hierarchical method we present is base ...

Gossip algorithms and their accelerated versions have been studied exclusively in discrete time on graphs. In this work, we take a different approach and consider the scaling limit of gossip algorithms in both large graphs and large number of iterations. T ...

The central task in many interactive machine learning systems can be formalized as the sequential optimization of a black-box function. Bayesian optimization (BO) is a powerful model-based framework for \emph{adaptive} experimentation, where the primary go ...

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 ...

In the current work we present two generalizations of the Parallel Tempering algorithm in the context of discrete-timeMarkov chainMonteCarlo methods for Bayesian inverse problems. These generalizations use state-dependent swapping rates, inspired by the so ...

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 ...

We propose and analyze a finite-difference discretization of the Ambrosio-Tortorelli functional. It is known that if the discretization is made with respect to an underlying periodic lattice of spacing ffi, the discretized functionals Gamma-converge to the ...

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 ...

In distributed optimization, parameter updates from the gradient computing node devices have to be aggregated in every iteration on the orchestrating server. When these updates are sent over an arbitrary commodity network, bandwidth and latency can be limi ...

Probabilistic parameter estimation in model fitting runs the gamut from maximum likelihood or maximum a posteriori point estimates from optimization to Markov Chain Monte Carlo (MCMC) sampling. The latter, while more computationally intensive, generally pr ...

We prove that every elementary (infinity, 1)-topos has a natural number object. We achieve this by defining the loop space of the circle and showing that we can construct a natural number object out of it. Part of the proof involves showing that various de ...

In hidden Markov model (HMM) based automatic speech recognition (ASR) system, modeling the statistical relationship between the acoustic speech signal and the HMM states that represent linguistically motivated subword units such as phonemes is a crucial st ...

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

Chat with Graph Search

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

A note on universal inference

Multilingual Training and Adaptation in Speech Recognition

On polyhedral graphs and their complements

Predicting learners' effortful behaviour in adaptive assessment using multimodal data

Factorial Lower Bounds for (Almost) Random Order Streams

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

The time-dependent expected reward and deviation matrix of a finite QBD process

HIERARCHICAL MARKOV CHAIN MONTE CARLO METHODS FOR BAYESIAN INVERSE PROBLEMS

Acceleration of gossip algorithms through the Euler-Poisson-Darboux Equation

Robust Adaptive Decision Making: Bayesian Optimization and Beyond

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

Generalized parallel tempering on Bayesian inverse problems

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

Random Finite-Difference Discretizations Of The Ambrosio-Tortorelli Functional With Optimal Mesh-Size

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

LENA: Communication-Efficient Distributed Learning with Self-Triggered Gradient Uploads

Robust Biophysical Parameter Estimation with a Neural Network Enhanced Hamiltonian Markov Chain Monte Carlo Sampler

Every Elementary Higher Topos Has A Natural Number Object

End-to-End Acoustic Modeling using Convolutional Neural Networks for HMM-based Automatic Speech Recognition