Almost-Uniform Sampling of Points on High-Dimensional Algebraic Varieties

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.

As large, data-driven artificial intelligence models become ubiquitous, guaranteeing high data quality is imperative for constructing models. Crowdsourcing, community sensing, and data filtering have long been the standard approaches to guaranteeing or imp ...

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

Let k be a field, and let L be an etale k-algebra of finite rank. If a is an element of k(x), let X-a be the affine variety defined by N-L/k(x) = a. Assuming that L has at least one factor that is a cyclic field extension of k, we give a combinatorial desc ...

In this paper we use the Riemann zeta distribution to give a new proof of the Erdos-Kac Central Limit Theorem. That is, if zeta(s) = Sigma(n >= 1) (1)(s)(n) , s > 1, then we consider the random variable X-s with P(X-s = n) = (1) (zeta) ( ...

BackgroundAging in postmitotic tissues is associated with clonal expansion of somatic mitochondrial deletions, the origin of which is not well understood. Such deletions are often flanked by direct nucleotide repeats, but this alone does not fully explain ...

Minimising the longest travel distance for a group of mobile robots with interchangeable goals requires knowledge of the shortest length paths between all robots and goal destinations. Determining the exact length of the shortest paths in an environment wi ...

In this thesis, we give new approximation algorithms for some NP-hard problems arising in resource allocation and network design. As a resource allocation problem, we study the Santa Claus problem (also known as the MaxMin Fair Allocation problem) in which ...

This paper considers the problem of distributed lossy compression where the goal is to recover one or more linear combinations of the sources at the decoder, subject to distortion constraints. For certain configurations, it is known that codes with algebra ...

In this thesis we consider the problem of estimating the correlation of Hecke eigenvalues of GL2 automorphic forms with a class of functions of algebraic origin defined over finite fields called trace functions. The class of trace functions is vast and inc ...

Deep-learning-based digital twins (DDT) are a promising tool for data-driven system health management because they can be trained directly on operational data. A major challenge for efficient training however is that industrial datasets remain unlabeled. T ...

Self-attention mechanisms and non-local blocks have become crucial building blocks for state-of-the-art neural architectures thanks to their unparalleled ability in capturing long-range dependencies in the input. However their cost is quadratic with the nu ...

Interactions are ubiquitous in our world, spanning from social interactions between human individuals to physical interactions between robots and objects to mechanistic interactions among different components of an intelligent system. Despite their prevale ...

The development of small-angle scattering tensor tomography has enabled the study of anisotropic nanostructures in a volume-resolved manner. It is of great value to have reconstruction methods that can handle many different nanostructural symmetries. For s ...

We show that mixed-characteristic and equicharacteristic small deformations of 3-dimensional canonical (resp., terminal) singularities with perfect residue field of characteristic p>5 are canonical (resp., terminal). We discuss applications to arithmetic a ...

This thesis is constituted of one article and three preprints that I wrote during my PhD thesis. Their common theme is the moduli theory of algebraic varieties. In the first article I study the Chow--Mumford line bundle for families of uniformly K-stable F ...

We present a quasilinear time algorithm to decide the word problem on a natural algebraic structures we call orthocomplemented bisemilattices, a subtheory of boolean algebra. We use as a base a variation of Hopcroft, Ullman and Aho algorithm for tree isomo ...

We study the computational complexity of the optimal transport problem that evaluates the Wasser- stein distance between the distributions of two K-dimensional discrete random vectors. The best known algorithms for this problem run in polynomial time in th ...

Deep neural networks have completely revolutionized the field of machine learning by achieving state-of-the-art results on various tasks ranging from computer vision to protein folding. However, their application is hindered by their large computational an ...

In this thesis, we investigate the inverse problem of trees and barcodes from a combinatorial, geometric, probabilistic and statistical point of view. Computing the persistent homology of a merge tree yields a barcode B. Reconstructing a tree from B invol ...

Almost-Uniform Sampling of Points on High-Dimensional Algebraic Varieties

Chat with Graph Search

Extensions of Peer Prediction Incentive Mechanisms

Unlabeled Principal Component Analysis and Matrix Completion

The multivariate Serre conjecture ring

NORM TORI OF ETALE ALGEBRAS AND UNRAMIFIED BRAUER GROUPS

A NEW PROOF OF THE ERDOS-KAC CENTRAL LIMIT THEOREM

Secondary structure of the human mitochondrial genome affects formation of deletions

Certification of Bottleneck Task Assignment With Shortest Path Criteria

Approximation Algorithms for Allocation and Network Design

Distributed Lossy Computation with Structured Codes: From Discrete to Continuous Sources

Algebraic twists of GL(2) automorphic forms

A Study on Gradient-based Meta-learning for Robust Deep Digital Twins

Linear Complexity Self-Attention With 3rd Order Polynomials

Learning Robust and Adaptive Representations: from Interactions, for Interactions

Small-angle scattering tensor tomography algorithm for robust reconstruction of complex textures

Arithmetic and geometric deformations of threefolds

On the projectivity of some moduli spaces of varieties

Equivalence Checking for Orthocomplemented Bisemilattices in Log-Linear Time

Discrete Optimal Transport with Independent Marginals is #P-Hard

Stop Wasting my FLOPS: Improving the Efficiency of Deep Learning Models

From Trees to Barcodes and Back Again: A Combinatorial, Probabilistic and Geometric Study of a Topological Inverse Problem