A Probabilistic Approach of Sum Rules for Heat Polynomials

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.

Deep heteroscedastic regression involves jointly optimizing the mean and covariance of the predicted distribution using the negative log-likelihood. However, recent works show that this may result in sub-optimal convergence due to the challenges associated ...

We introduce robust principal component analysis from a data matrix in which the entries of its columns have been corrupted by permutations, termed Unlabeled Principal Component Analysis (UPCA). Using algebraic geometry, we establish that UPCA is a well-de ...

It is well-known that for any integral domain R, the Serre conjecture ring R(X), i.e., the localization of the univariate polynomial ring R[X] at monic polynomials, is a Bezout domain of Krull dimension

Intelligent fault diagnosis has been increasingly improved with the evolution of deep learning (DL) approaches. Recently, the emerging graph neural networks (GNNs) have also been introduced in the field of fault diagnosis with the goal to make better use o ...

The goal of this paper is to characterize function distributions that general neural networks trained by descent algorithms (GD/SGD), can or cannot learn in polytime. The results are: (1) The paradigm of general neural networks trained by SGD is poly-time ...

Most modern image-based 6D object pose estimation methods learn to predict 2D-3D correspondences, from which the pose can be obtained using a PnP solver. Because of the non-differentiable nature of common PnP solvers, these methods are supervised via the i ...

We study three convolutions of polynomials in the context of free probability theory. We prove that these convolutions can be written as the expected characteristic polynomials of sums and products of unitarily invariant random matrices. The symmetric addi ...

Polynomial neural networks (PNNs) have been recently shown to be particularly effective at image generation and face recognition, where high-frequency information is critical. Previous studies have revealed that neural networks demonstrate a spectral bias ...

The celebrated PCP Theorem states that any language in NP can be decided via a verifier that reads O(1) bits from a polynomially long proof. Interactive oracle proofs (IOP), a generalization of PCPs, allow the verifier to interact with the prover for multi ...

We generalize the hidden-fermion family of neural network quantum states to encompass both continuous and discrete degrees of freedom and solve the nuclear many-body Schrodinger equation in a systematically improvable fashion. We demonstrate that adding hi ...

We use the method of interlacing families of polynomials to derive a simple proof of Bourgain and Tzafriri's Restricted Invertibility Principle, and then to sharpen the result in two ways. We show that the stable rank can be replaced by the Schatten 4-norm ...

In this paper we study the moments of polynomials from the Askey scheme, and we focus on Askey-Wilson polynomials. More precisely, we give a combinatorial proof for the case where d = 0. Their values have already been computed by Kim and Stanton in 2015, h ...

Without resorting to complex numbers or any advanced topological arguments, we show that any real polynomial of degree greater than two always has a real quadratic polynomial factor, which is equivalent to the fundamental theorem of algebra. The proof uses ...

We consider the singular set in the thin obstacle problem with weight vertical bar x(n +1)vertical bar(a) for a epsilon (-1, 1), which arises as the local extension of the obstacle problem for the fractional Laplacian (a nonlocal problem). We develop a ref ...

The present work deals with monochromatic wavefront aberrations in optical systems without symmetries. The treatment begins with a class of systems characterized by misaligned spherical surfaces whose behavior is analyzed using the wavefront aberration exp ...

We measure the anisotropic clustering of the quasar sample from Data Release 16 (DR16) of the Sloan Digital Sky Survey IV extended Baryon Oscillation Spectroscopic Survey (eBOSS). A sample of 343 708 spectroscopically confirmed quasars between redshift 0.8 ...

Aims. We investigate the contribution of shot-noise and sample variance to uncertainties in the cosmological parameter constraints inferred from cluster number counts, in the context of the Euclid survey. ...

A gyrokinetic model is presented that can properly describe large and small amplitude electromagnetic fluctuations occurring on scale lengths ranging from the electron Larmor radius to the equilibrium perpendicular pressure gradient scale length, and the a ...

This paper presents an accuracy-preserving p-weighted limiter for discontinuous Galerkin methods on one-dimensional and two-dimensional triangular grids. The p-weighted limiter is the extension of the second-order WENO limiter by Li et al. [W. Li, J. Pan a ...

We study discretizations of polynomial processes using finite state Markov processes satisfying suitable moment matching conditions. The states of these Markov processes together with their transition probabilities can be interpreted as Markov cubature rul ...

A Probabilistic Approach of Sum Rules for Heat Polynomials

Chat with Graph Search

TIC-TAC: A Framework for Improved Covariance Estimation in Deep Heteroscedastic Regression

Unlabeled Principal Component Analysis and Matrix Completion

The multivariate Serre conjecture ring

Filter-Informed Spectral Graph Wavelet Networks for Multiscale Feature Extraction and Intelligent Fault Diagnosis

Polynomial-time universality and limitations of deep learning

Linear-Covariance Loss for End-to-End Learning of 6D Pose Estimation

Finite free convolutions of polynomials

The spectral bias of polynomial neural networks

A PCP Theorem for Interactive Proofs and Applications

Hidden-nucleons neural-network quantum states for the nuclear many-body problem

Interlacing families III: Sharper restricted invertibility estimates

Computation of Al-Salam Carlitz and Askey-Wilson moments using Motzkin paths

Strictly Real Fundamental Theorem Of Algebra Using Polynomial Interlacing

On The Singular Set In The Thin Obstacle Problem: Higher-Order Blow-Ups And The Very Thin Obstacle Problem

ON WAVEFRONT ABERRATIONS IN ASYMMETRIC AND MULTIPLE APERTURE OPTICAL SYSTEMS

The completed SDSS-IV extended Baryon Oscillation Spectroscopic Survey: BAO and RSD measurements from anisotropic clustering analysis of the quasar sample in configuration space between redshift 0.8 and 2.2

Euclid : Effects of sample covariance on the number counts of galaxy clusters

A gyrokinetic model for the plasma periphery of tokamak devices

A p-weighted limiter for the discontinuous Galerkin method on one-dimensional and two-dimensional triangular grids

Markov cubature rules for polynomial processes