Adaptive Path Interpolation for Sparse Systems: Application to a Simple Censored Block Model

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 introduce contextual stochastic bilevel optimization (CSBO) -- a stochastic bilevel optimization framework with the lower-level problem minimizing an expectation conditioned on some contextual information and the upper-level decision variable. This fram ...

The growing demand for online gait phase (GP) estimation, driven by advancements in exoskeletons and prostheses, has prompted numerous approaches in the literature. Some approaches explicitly use time, while others rely on state variables to estimate the G ...

Total Flow Analysis (TFA) is a method for the worst-case analysis of time-sensitive networks. It uses service curve characterizations of the network nodes and arrival curves of flows at their sources; for tractability, the latter are often taken to be line ...

In this paper, we investigate the impact of stochasticity and large stepsizes on the implicit regularisation of gradient descent (GD) and stochastic gradient descent (SGD) over diagonal linear networks. We prove the convergence of GD and SGD with macroscop ...

Speech recognition-based applications upon the advancements in artificial intelligence play an essential role to transform most aspects of modern life. However, speech recognition in real-life conditions (e.g., in the presence of overlapping speech, varyin ...

We present TimeEvolver, a program for computing time evolution in a generic quantum system. It relies on well-known Krylov subspace techniques to tackle the problem of multiplying the exponential of a large sparse matrix iH, where His the Hamiltonian, with ...

State-of-the-art Artificial Intelligence (AI) algorithms, such as graph neural networks and recommendation systems, require floating-point computation of very large matrix multiplications over sparse data. Their execution in resource-constrained scenarios, ...

The discretization of robust quadratic optimal control problems under uncertainty using the finite element method and the stochastic collocation method leads to large saddle-point systems, which are fully coupled across the random realizations. Despite its ...

We propose an image-based elastography method to measure the heterogeneous stiffness inside a cell and its nucleus. It uses a widely accessible setup consisting of plate compression imaged with fluorescence microscopy. Our framework recovers a spatial map ...

Learning-based outlier (mismatched correspondence) rejection for robust 3D registration generally formulates the outlier removal as an inlier/outlier classification problem. The core for this to be successful is to learn the discriminative inlier/outlier f ...

The goal of this thesis is to study continuous-domain inverse problems for the reconstruction of sparse signals and to develop efficient algorithms to solve such problems computationally. The task is to recover a signal of interest as a continuous function ...

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

The lattice Green's function method (LGFM) is the discrete counterpart of the continuum boundary element method and is a natural approach for solving intrinsically discrete solid mechanics problems that arise in atomistic-continuum coupling methods. Here, ...

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

While domain adaptation has been used to improve the performance of object detectors when the training and test data follow different distributions, previous work has mostly focused on two-stage detectors. This is because their use of region proposals make ...

We introduce a local adaptive discontinuous Galerkin method for convection-diffusion-reaction equations. The proposed method is based on a coarse grid and iteratively improves the solution's accuracy by solving local elliptic problems in refined subdomains ...

Nowadays mobile phones have become indispensable, as they have been endowed with many of the capabilities that a user was able to achieve previously with the help of PCs only. Among the functions that mobile phones perform we identify audio and video calls ...

We consider a least-squares/relaxation finite element method for the numerical solution of the prescribed Jacobian equation. We look for its solution via a least-squares approach. We introduce a relaxation algorithm that decouples this least-squares proble ...

Adaptive Path Interpolation for Sparse Systems: Application to a Simple Censored Block Model

Chat with Graph Search

Contextual Stochastic Bilevel Optimization

State-Based Versus Time-Based Estimation of the Gait Phase for Hip Exoskeletons in Steady and Transient Walking

Efficient and Accurate Handling of Periodic Flows in Time-Sensitive Networks

(S)GD over Diagonal Linear Networks: Implicit Regularisation, Large Stepsizes and Edge of Stability

Sparse Autoencoders for Speech Modeling and Recognition

TimeEvolver: A program for time evolution with improved error bound

A 16-bit Floating-Point Near-SRAM Architecture for Low-power Sparse Matrix-Vector Multiplication

Preconditioners for robust optimal control problems under uncertainty

PROBING INTRACELLULAR ELASTICITY WITH MINIMAL-HESSIAN REGISTRATION

Robust Outlier Rejection for 3D Registration with Variational Bayes

Variational Methods For Continuous-Domain Inverse Problems: the Quest for the Sparsest Solution

Higher Order Asymptotics: Applications to Satellite Conjunction and Boundary Problems

Efficient lattice Green's function method for bounded domain problems

HIERARCHICAL MARKOV CHAIN MONTE CARLO METHODS FOR BAYESIAN INVERSE PROBLEMS

Attention-based domain adaptation for single-stage detectors

A local adaptive discontinuous Galerkin method for convection-diffusion-reaction equations

Simulation Of New Methods Using Applications Which Exflitrate Data From Android Phones

A Least-Squares Method for the Solution of the Non-smooth Prescribed Jacobian Equation