Converse Bounds for Noisy Group Testing with Arbitrary Measurement Matrices

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.

Given oracle access to a real-valued function on the n-dimensional Boolean cube, how many queries does it take to estimate the squared Euclidean distance to its closest linear function within ϵ? Our main result is that O(log3(1/ϵ) · 1/ϵ2) queries suffice. ...

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

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

State-of-the-art results in large language models (LLMs) often rely on scale, which becomes computationally expensive. This has sparked a research agenda to reduce these models' parameter counts and computational costs without significantly impacting their ...

The accurate, robust and efficient transfer of the deformation gradient tensor between meshes of different resolution is crucial in cardiac electromechanics simulations. This paper presents a novel method that combines rescaled localized Radial Basis Funct ...

In this manuscript we consider denoising of large rectangular matrices: given a noisy observation of a signal matrix, what is the best way of recovering the signal matrix itself? For Gaussian noise and rotationally-invariant signal priors, we completely ch ...

We consider fundamental algorithmic number theoretic problems and their relation to a class of block structured Integer Linear Programs (ILPs) called 2-stage stochastic. A 2-stage stochastic ILP is an integer program of the form min{c(T)x vertical bar Ax = ...

How can we discern whether the covariance operator of a stochastic pro-cess is of reduced rank, and if so, what its precise rank is? And how can we do so at a given level of confidence? This question is central to a great deal of methods for functional dat ...

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

The Transfer Matrix formalism is ubiquitous when it comes to study wave propagation in various stratified media, applications ranging from Seismology to Quantum Mechanics. A relation between variables at two points in two different layers can be establishe ...

Eigendecomposition of symmetric matrices is at the heart of many computer vision algorithms. However, the derivatives of the eigenvectors tend to be numerically unstable, whether using the SVD to compute them analytically or using the Power Iteration (PI) ...

We propose a principled method for projecting an arbitrary square matrix to the non- convex set of asymptotically stable matrices. Leveraging ideas from large deviations theory, we show that this projection is optimal in an information-theoretic sense and ...

We introduce a protocol addressing the conformance test problem, which consists in determining whether a process under test conforms to a reference one. We consider a process to be characterized by the set of end products it produces, which is generated ac ...

Based on the spectral divide-and-conquer algorithm by Nakatsukasa and Higham [SIAM J. Sci. Comput., 35(3):A1325-A1349, 2013], we propose a new algorithm for computing all the eigenvalues and eigenvectors of a symmetric banded matrix with small bandwidth, w ...

The problem of finding a k x k submatrix of maximum volume of a matrix A is of interest in a variety of applications. For example, it yields a quasi-best low-rank approximation constructed from the rows and columns of A. We show that such a submatrix can a ...

Inductive proximity sensors are low-cost and versatile detectors achieving resolutions in the nm and sub-nm range. Their typical working frequency ranges from tens of kHz to a few MHz. Operation at higher frequencies is considered as a possible route for t ...

In the context of next-generation radio interferometers, we are facing a big challenge of how to economically process data. The classical dimensionality reduction technique, averaging visibilities on time, may dilute fast radio transients (FRT). We propose ...

Crossbar arrays of non-volatile memory (NVM) devices represent one possible path for implementing highly energy-efficient neuromorphic computing systems. For Deep Neural Networks (DNN), where information can be encoded as analog voltage and current levels, ...

Consider the problem of minimizing a convex differentiable function on the probability simplex, spectrahedron, or set of quantum density matrices. We prove that the expo-nentiated gradient method with Armijo line search always converges to the optimum, if ...

We consider integer programming problems max {c^Tx : A x = b, l

Converse Bounds for Noisy Group Testing with Arbitrary Measurement Matrices

Chat with Graph Search

Estimating Euclidean Distance to Linearity

Spectral Estimators for High-Dimensional Matrix Inference

RANDOMIZED JOINT DIAGONALIZATION OF SYMMETRIC

Building on Efficient Foundations: Effectively Training LLMs with Structured Feedforward Layers

Preserving the positivity of the deformation gradient determinant in intergrid interpolation by combining RBFs and SVD: Application to cardiac electromechanics

Optimal denoising of rotationally invariant rectangular matrices

The double exponential runtime is tight for 2-stage stochastic ILPs

Testing For The Rank Of A Covariance Operator

TimeEvolver: A program for time evolution with improved error bound

Harmonic decomposition of the trace of 1D transfer matrices in layered media

Robust Differentiable SVD

Efficient Learning of a Linear Dynamical System with Stability Guarantees

Quantum conformance test

A fast spectral divide-and-conquer method for banded matrices

On maximum volume submatrices and cross approximation for symmetric semidefinite and diagonally dominant matrices

Microwave inductive proximity sensors with sub-pm/Hz1/2 resolution

Fourier dimensionality reduction for fast radio transients

Non-filamentary non-volatile memory elements as synapses in neuromorphic systems

Convergence of the Exponentiated Gradient Method with Armijo Line Search

Faster Algorithms for Integer Programs with Block Structure