Norm And Trace Estimation With Random Rank-One Vectors

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.

The numerical solution of the generalized eigenvalue problem for a singular matrix pencil is challenging due to the discontinuity of its eigenvalues. Classically, such problems are addressed by first extracting the regular part through the staircase form a ...

We consider the problem of finding a basis of a matroid with weight exactly equal to a given target. Here weights can be discrete values from

\{-\Delta,\ldots,\Delta\}

or more generally

m

-dimensional vectors of such discrete values. We resolve the para ...

In placebo-controlled randomized clinical trials, adherence to the placebo is often supposed to have no effect on the primary outcome of interest: when unbiased methods are used, investigators expect to estimate a null effect. Estimating the 'effect' of ad ...

Numerical continuation in the context of optimization can be used to mitigate convergence issues due to a poor initial guess. In this work, we extend this idea to Riemannian optimization problems, that is, the minimization of a target function on a Riemann ...

We prove that the E8 root lattice and the Leech lattice are universally optimal among point configurations in Euclidean spaces of dimensions eight and twenty-four, respectively. In other words, they minimize energy for every potential function that is a co ...

We explore the birational structure and invariants of a foliated surface ( X , F ) in terms of the adjoint divisor K-F + epsilon K-X, 0 < epsilon & laquo; 1 0 . We then establish a bound on the automorphism group of an adjoint general type foliated surface ...

We consider the Dynamical Low Rank (DLR) approximation of random parabolic equations and propose a class of fully discrete numerical schemes. Similarly to the continuous DLR approximation, our schemes are shown to satisfy a discrete variational formulation ...

We discuss some properties of generative models for word embeddings. Namely, (Arora et al., 2016) proposed a latent discourse model implying the concentration of the partition function of the word vectors. This concentration phenomenon led to an asymptotic ...

Multi-echo T-2 magnetic resonance images contain information about the distribution of T-2 relaxation times of compartmentalized water, from which we can estimate relevant brain tissue properties such as the myelin water fraction (MWF). Regularized non-neg ...

Walking/gait speed is a key measure for daily mobility characterization. To date, various studies have attempted to design algorithms to estimate walking speed using an inertial sensor worn on the lower back, which is considered as a proper location for ac ...

This paper argues that randomized linear sketching is a natural tool for on-the-fly compression of data matrices that arise from large-scale scientific simulations and data collection. The technical contribution consists in a new algorithm for constructing ...

Two characteristics that make convex decomposition algorithms attractive are simplicity of operations and generation of parallelizable structures. In principle, these schemes require that all coordinates update at the same time, i.e., they are synchronous ...

Let P be a partially ordered set. The function La* (n, P) denotes the size of the largest family F subset of 2([n]) that does not contain an induced copy of P. It was proved by Methuku and Palvolgyi that there exists a constant C-P (depending only on P) su ...

Quantum memory management is becoming a pressing problem, especially given the recent research effort to develop new and more complex quantum algorithms. The only existing automatic method for quantum states clean-up relies on the availability of many extr ...

Norm And Trace Estimation With Random Rank-One Vectors

Chat with Graph Search

Analysis of eigenvalue condition numbers for a class of randomized numerical methods for singular matrix pencils

Sensitivity, Proximity and FPT Algorithms for Exact Matroid Problems

Placebo Adherence as a Negative Control Exposure

Continuation Methods For Riemannian Optimization

Universal optimality of the E8 and Leech lattices and interpolation formulas

Effective generation for foliated surfaces: Results and applications

Stability properties of a projector-splitting scheme for dynamical low rank approximation of random parabolic equations

Further results on latent discourse models and word embeddings

Revisiting the T-2 spectrum imaging inverse problem: Bayesian regularized non-negative least squares

Algorithms for Walking Speed Estimation Using a Lower-Back-Worn Inertial Sensor: A Cross-Validation on Speed Ranges

Streaming Low-Rank Matrix Approximation With An Application To Scientific Simulation

An Inertial Parallel and Asynchronous Forward-Backward Iteration for Distributed Convex Optimization

Forbidden induced subposets of given height

Reversible Pebbling Game for Quantum Memory Management