Approximating the Gaussian Multiple Description Rate Region Under Symmetric Distortion

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.

A key challenge across many disciplines is to extract meaningful information from data which is often obscured by noise. These datasets are typically represented as large matrices. Given the current trend of ever-increasing data volumes, with datasets grow ...

In the rapidly evolving landscape of machine learning research, neural networks stand out with their ever-expanding number of parameters and reliance on increasingly large datasets. The financial cost and computational resources required for the training p ...

Given a family of nearly commuting symmetric matrices, we consider the task of computing an orthogonal matrix that nearly diagonalizes every matrix in the family. In this paper, we propose and analyze randomized joint diagonalization (RJD) for performing t ...

This paper rethinks Sharpness-Aware Minimization (SAM), which is originally formulated as a zero-sum game where the weights of a network and a bounded perturbation try to minimize/maximize, respectively, the same differentiable loss. We argue that SAM shou ...

In this thesis we study stability from several viewpoints. After covering the practical importance, the rich history and the ever-growing list of manifestations of stability, we study the following. (i) (Statistical identification of stable dynamical syste ...

Information theory has allowed us to determine the fundamental limit of various communication and algorithmic problems, e.g., the channel coding problem, the compression problem, and the hypothesis testing problem. In this work, we revisit the assumptions ...

Given two jointly distributed random variables (X,Y), a functional representation of X is a random variable Z independent of Y, and a deterministic function g(⋅,⋅) such that X=g(Y,Z). The problem of finding a minimum entropy functional representation is kn ...

In this paper, we consider electric vehicle charging facilities that offer various levels of service, i.e., charging rates, for varying prices such that rational users choose a level of service that minimizes the total cost to themselves including an oppor ...

This work presents a new computational optimization framework for the robust control of parks of Wave Energy Converters (WEC) in irregular waves. The power of WEC parks is maximized with respect to the individual control damping and stiffness coefficients ...

In this article, we consider decentralized optimization problems where agents have individual cost functions to minimize subject to subspace constraints that require the minimizers across the network to lie in low-dimensional subspaces. This constrained fo ...

A multi-agent system consists of a collection of decision-making or learning agents subjected to streaming observations from some real-world phenomenon. The goal of the system is to solve some global learning or optimization problem in a distributed or dec ...

We study the problem of estimating an unknown function from noisy data using shallow ReLU neural networks. The estimators we study minimize the sum of squared data-fitting errors plus a regularization term proportional to the squared Euclidean norm of the ...

In 1948, Claude Shannon laid the foundations of information theory, which grew out of a study to find the ultimate limits of source compression, and of reliable communication. Since then, information theory has proved itself not only as a quest to find the ...

In this paper we use the Riemann zeta distribution to give a new proof of the Erdos-Kac Central Limit Theorem. That is, if zeta(s) = Sigma(n >= 1) (1)(s)(n) , s > 1, then we consider the random variable X-s with P(X-s = n) = (1) (zeta) ( ...

We present a statistical framework to benchmark the performance of reconstruction algorithms for linear inverse problems, in particular, neural-network-based methods that require large quantities of training data. We generate synthetic signals as realizati ...

Linear-Quadratic-Gaussian (LQG) control is a fundamental control paradigm that is studied in various fields such as engineering, computer science, economics, and neuroscience. It involves controlling a system with linear dynamics and imperfect observations ...

Purpose: To develop a self-navigated motion compensation strategy for 3D radial MRI that can compensate for continuous head motion by measuring rigid body motion parameters with high temporal resolution from the central k-space acquisition point (self-enco ...

In this work, we systematically evaluate the accuracy in band gap prediction of range-separated hybrid functionals on a large set of semiconducting and insulating materials and carry out comparisons with the performance of their global counterparts. We obs ...

This paper considers the problem of distributed lossy compression where the goal is to recover one or more linear combinations of the sources at the decoder, subject to distortion constraints. For certain configurations, it is known that codes with algebra ...

In this paper, we investigate federated contextual linear bandit learning within a wireless system that comprises a server and multiple devices. Each device interacts with the environment, selects an action based on the received reward, and sends model upd ...

Approximating the Gaussian Multiple Description Rate Region Under Symmetric Distortion

Chat with Graph Search

Spectral Estimators for High-Dimensional Matrix Inference

Random matrix methods for high-dimensional machine learning models

RANDOMIZED JOINT DIAGONALIZATION OF SYMMETRIC

Improving SAM Requires Rethinking its Optimization Formulation

Stability: a search for structure

On Speed and Advantage : Results in Information Velocity and Monitoring Problems

Information Spectrum Converse for Minimum Entropy Couplings and Functional Representations

Sensitivity to user mischaracterizations in electric vehicle charging

Robust optimization of control parameters for WEC arrays using stochastic methods

Quantization for Decentralized Learning Under Subspace Constraints

Multi-agent Learning with Privacy Guarantees

Near-Minimax Optimal Estimation With Shallow ReLU Neural Networks

Time vs. Truth: Age-Distortion Tradeoffs and Strategies for Distributed Inference

A NEW PROOF OF THE ERDOS-KAC CENTRAL LIMIT THEOREM

A Statistical Framework to Investigate the Optimality of Signal-Reconstruction Methods

Distributionally Robust Linear Quadratic Control

Rapid motion estimation and correction using self-encoded FID navigators in 3D radial MRI

Range-separated hybrid functionals for accurate prediction of band gaps of extended systems

Distributed Lossy Computation with Structured Codes: From Discrete to Continuous Sources

Federated Linear Bandit Learning via Over-the-air Computation