Concept

Variété algébrique

Publications associées (32)

Unlabeled Principal Component Analysis and Matrix Completion

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

Microtome Publ2024

Palladium-based supramolecular assemblies: from complex structures to water-soluble anion-receptors

Sylvain Alexandre Marie Sudan

The combination of palladium salts and bipyridyl ligands can lead to the formation of a large variety of coordination complexes, with different shapes and sizes, displaying a very versatile host-guest chemistry. Increasing their structural complexity remai ...

EPFL2024

Roughness Evolution Induced by Third-Body Wear

Jean-François Molinari, Antonio Joaquin Garcia Suarez, Tobias Brink

Surface roughness is a key factor when it comes to friction and wear, as well as to other physical properties. These phenomena are controlled by mechanisms acting at small scales, in which the topography of apparently flat surfaces is revealed. Roughness i ...

New York2024

Incorporating Projective Geometry into Deep Learning

Michal Jan Tyszkiewicz

In this thesis we explore the applications of projective geometry, a mathematical theory of the relation between 3D scenes and their 2D images, in modern learning-based computer vision systems. This is an interesting research question which contradicts the ...

EPFL2024

Novel Alkynylation Methods through the Combination of Hypervalent Iodine Reagents and Alkynyl-trifluoroborate Salts

Julien Aymeric Borrel

The alkyne motif is a versatile functional group often encountered in organic chemistry. It can be involved in various transformations such as the alkyne-azide cycloaddition and has found widespread application in medicinal chemistry, chemical biology and ...

EPFL2024

Multiplicity-free Representations of Algebraic Groups

Donna Testerman, Martin W. Liebeck

Let K be an algebraically closed field of characteristic zero, and let G be a connected reductive algebraic group over K. We address the problem of classifying triples (G, H, V ), where H is a proper connected subgroup of G, and V is a finitedimensional ir ...

Amer Mathematical Soc2024

Algebraic twists of GL(2) automorphic forms

Vignesh Arumugam Nadarajan

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

EPFL2023

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

Michael Christoph Gastpar, Sung Hoon Lim, Adriano Pastore, Chen Feng

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

2023

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

Marianne Liebi, Manuel Guizar Sicairos

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

Chester2023

Adversarial vulnerability bounds for Gaussian process classification

Kathrin Grosse

Protecting ML classifiers from adversarial examples is crucial. We propose that the main threat is an attacker perturbing a confidently classified input to produce a confident misclassification. We consider in this paper the attack in which a small number ...

2023

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