Publications associées à Decompositions of dependence for high-dimensional extremes

The ABCD of topological recursion

Kontsevich and Soibelman reformulated and slightly generalised the topological recursion of [43], seeing it as a quantisation of certain quadratic Lagrangians in T*V for some vector space V. KS topological recursion is a procedure which takes as initial da ...

San Diego2024

Persistence and the Sheaf-Function Correspondence

Nicolas Michel Berkouk

The sheaf-function correspondence identifies the group of constructible functions on a real analytic manifold M with the Grothendieck group of constructible sheaves on M. When M is a finite dimensional real vector space, Kashiwara-Schapira have recently in ...

Cambridge2023

A Functional Perspective on Information Measures

Amedeo Roberto Esposito

Since the birth of Information Theory, researchers have defined and exploited various information measures, as well as endowed them with operational meanings. Some were born as a "solution to a problem", like Shannon's Entropy and Mutual Information. Other ...

EPFL2022

IMPROVED VARIANTS OF THE HUTCH plus plus ALGORITHM FOR TRACE ESTIMATION

Daniel Kressner, Ulf David Persson, Alice Cortinovis

This paper is concerned with two improved variants of the Hutch++ algorithm for estimating the trace of a square matrix, implicitly given through matrix-vector products. Hutch++ combines randomized low-rank approximation in a first phase with stochastic tr ...

SIAM PUBLICATIONS2022

Efficient and Effective Multi-Modal Queries Through Heterogeneous Network Embedding

Karl Aberer, Thanh Trung Huynh, Quoc Viet Hung Nguyen, Thành Tâm Nguyên, Chi Thang Duong

The heterogeneity of today's Web sources requires information retrieval (IR) systems to handle multi-modal queries. Such queries define a user's information needs by different data modalities, such as keywords, hashtags, user profiles, and other media. Rec ...

IEEE COMPUTER SOC2022

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

Daniel Kressner, Stefano Massei, Alice Cortinovis

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

ELSEVIER SCIENCE INC2020

Rational Krylov for Stieltjes matrix functions: convergence and pole selection

Stefano Massei

Evaluating the action of a matrix function on a vector, that is

x=f(\mathcal M)v

, is an ubiquitous task in applications. When

\mathcal M

is large, one usually relies on Krylov projection methods. In this paper, we provide effective choices for the pole ...

2019

MATHICSE Technical Report : On maximum volume submatrices and cross approximation for symmetric semidefinite and diagonally dominant matrices

Daniel Kressner, Stefano Massei, Alice Cortinovis

The problem of finding a

k\times 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 ...

MATHICSE2019

Unsupervised Learning of Representations for Lexical Entailment Detection

Andreas Hug

Detecting lexical entailment plays a fundamental role in a variety of natural language processing tasks and is key to language understanding. Unsupervised methods still play an important role due to the lack of coverage of lexical databases in some domains ...

2018

Convergence of the Exponentiated Gradient Method with Armijo Line Search

Volkan Cevher, Yen-Huan Li

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

2018

Decompositions of dependence for high-dimensional extremes

Graph Chatbot

Chattez avec Graph Search

The ABCD of topological recursion

Persistence and the Sheaf-Function Correspondence

A Functional Perspective on Information Measures

IMPROVED VARIANTS OF THE HUTCH plus plus ALGORITHM FOR TRACE ESTIMATION

Efficient and Effective Multi-Modal Queries Through Heterogeneous Network Embedding

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

Rational Krylov for Stieltjes matrix functions: convergence and pole selection

MATHICSE Technical Report : On maximum volume submatrices and cross approximation for symmetric semidefinite and diagonally dominant matrices

Unsupervised Learning of Representations for Lexical Entailment Detection

Convergence of the Exponentiated Gradient Method with Armijo Line Search

The ABCD of topological recursion

A Functional Perspective on Information Measures

Persistence and the Sheaf-Function Correspondence

IMPROVED VARIANTS OF THE HUTCH plus plus ALGORITHM FOR TRACE ESTIMATION

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

Convergence of the Exponentiated Gradient Method with Armijo Line Search

MATHICSE Technical Report : On maximum volume submatrices and cross approximation for symmetric semidefinite and diagonally dominant matrices

Rational Krylov for Stieltjes matrix functions: convergence and pole selection

Efficient and Effective Multi-Modal Queries Through Heterogeneous Network Embedding

Unsupervised Learning of Representations for Lexical Entailment Detection