Concept

Matrice aléatoire

Publications associées (163)

A Local Law for Singular Values from Diophantine Equations

We introduce the

N\times N

random matrices

X_{j,k}=\exp\left(2\pi i \sum_{q=1}^d\ \omega_{j,q} k^q\right) \quad \text{with } \{\omega_{j,q}\}_{\substack{1\leq j\leq N\\ 1\leq q\leq d}} \text{ i.i.d. random variables},

and

d

a fixed integer. We pr ...

2020

Liouville Measure As A Multiplicative Cascade Via Level Sets Of The Gaussian Free Field

Juhan Aru

We provide new constructions of the subcritical and critical Gaussian multiplicative chaos (GMC) measures corresponding to the 2D Gaussian free field (GFF). As a special case we recover E. Aidekon's construction of random measures using nested conformally ...

ANNALES INST FOURIER2020

Symplectic dynamical low rank approximation of wave equations with random parameters

Fabio Nobile, Eleonora Musharbash, Eva Vidlicková

In this paper we propose a dynamical low-rank strategy for the approximation of second order wave equations with random parameters. The governing equation is rewritten in Hamiltonian form and the approximate solution is expanded over a set of 2S dynamical ...

2020

A new spatial count data model with Bayesian additive regression trees for accident hot spot identification

Prateek Bansal

The identification of accident hot spots is a central task of road safety management. Bayesian count data models have emerged as the workhorse method for producing probabilistic rankings of hazardous sites in road networks. Typically, these methods assume ...

2020

Phase retrieval in high dimensions: Statistical and computational phase transitions

Florent Gérard Krzakala, Lenka Zdeborová, Bruno Loureiro, Bruno Loureiro

We consider the phase retrieval problem of reconstructing a n -dimensional real or complex signal X ⋆ from m (possibly noisy) observations Y μ = | ∑ n i = 1 Φ μ i X ⋆ i / √ n | , for a large class of correlated real and complex random sensing matrices Φ , ...

Curran Associates, Inc.2020

MATHICSE Technical Report : A Multilevel Stochastic Gradient method for PDE-constrained Optimal Control Problems with uncertain parameters

Fabio Nobile, Matthieu Claude Martin, Panagiotis Tsilifis

In this paper, we present a multilevel Monte Carlo (MLMC) version of the Stochastic Gradient (SG) method for optimization under uncertainty, in order to tackle Optimal Control Problems (OCP) where the constraints are described in the form of PDEs with rand ...

MATHICSE2020

Fractional extreme distributions

Thomas Simon, Lotfi Boudabsa

We consider three classes of linear differential equations on distribution functions, with a fractional order alpha is an element of [0; 1]. The integer case alpha = 1 corresponds to the three classical extreme families. In general, we show that there is a ...

2020

Certified And Fast Computations With Shallow Covariance Kernels

Daniel Kressner, Stefano Massei

Many techniques for data science and uncertainty quantification demand efficient tools to handle Gaussian random fields, which are defined in terms of their mean functions and covariance operators. Recently, parameterized Gaussian random fields have gained ...

AMER INST MATHEMATICAL SCIENCES-AIMS2020

On the probability distribution of the local times of diagonally operator-self-similar Gaussian fields with stationary increments

Thomas Mountford, Kamran Kalbasi

In this paper, we study the local times of vector-valued Gaussian fields that are 'diagonally operator-selfsimilar' and whose increments are stationary. Denoting the local time of such a Gaussian field around the spatial origin and over the temporal unit h ...

INT STATISTICAL INST2020

Lipschitz constant estimation for Neural Networks via sparse polynomial optimization

Volkan Cevher, Paul Thierry Yves Rolland, Fabian Ricardo Latorre Gomez

We introduce LiPopt, a polynomial optimization framework for computing increasingly tighter upper bounds on the Lipschitz constant of neural networks. The underlying optimization problems boil down to either linear (LP) or semidefinite (SDP) programming. W ...

2020

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

A Local Law for Singular Values from Diophantine Equations

Marius Christopher Lemm

We introduce the

N\times N

random matrices

X_{j,k}=\exp\left(2\pi i \sum_{q=1}^d\ \omega_{j,q} k^q\right) \quad \text{with } \{\omega_{j,q}\}_{\substack{1\leq j\leq N\\ 1\leq q\leq d}} \text{ i.i.d. random variables},

and

d

a fixed integer. We pr ...

2020