Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Recherche

Afficher tous les résultats pour

Accueil

Catégorie

Réduction de la dimensionnalité

Applied sciences
Information engineering
Science des données
Réduction de la dimensionna...

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (11)

Page 1 sur 1

The topology of a chaotic attractor in the Kuramoto-Sivashinsky equation

Tobias Schneider, Pierre Beck

The Birman-Williams theorem gives a connection between the collection of unstable periodic orbits (UPOs) contained within a chaotic attractor and the topology of that attractor, for three-dimensional systems. In certain cases, the fractal dimension of a ch ...

2025

Graph sparsification, sketching and adaptivity

Mikhail Makarov

Many challenges of modern graph processing stem from the fact that graphs have become massive and change frequently. Numerous techniques have been developed to address those issues, with graph cut sparsification offering to replace original graphs with th ...

EPFL2025

Unlabeled Principal Component Analysis and Matrix Completion

Yunzhen Yao

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 Publishing2024

Quantum mixed state compiling

Zoë Holmes

The task of learning a quantum circuit to prepare a given mixed state is a fundamental quantum subroutine. We present a variational quantum algorithm (VQA) to learn mixed states which is suitable for near-term hardware. Our algorithm represents a generaliz ...

IOP Publishing Ltd2023

Scalable and Privacy-Preserving Federated Principal Component Analysis

Jean-Pierre Hubaux, Juan Ramón Troncoso-Pastoriza, Apostolos Pyrgelis, Joao André Gomes de Sá e Sousa, David Jules Froelicher, Jean-Philippe Léonard Bossuat

Principal component analysis (PCA) is an essential algorithm for dimensionality reduction in many data science domains. We address the problem of performing a federated PCA on private data distributed among multiple data providers while ensuring data confi ...

IEEE COMPUTER SOC2023

BigNeuron: a resource to benchmark and predict performance of algorithms for automated tracing of neurons in light microscopy datasets

Pascal Fua, Sean Lewis Hill, Jiancheng Yang, Amos Sironi, Jian Yang

BigNeuron is an open community bench-testing platform with the goal of setting open standards for accurate and fast automatic neuron tracing. We gathered a diverse set of image volumes across several species that is representative of the data obtained in m ...

Nature Publishing Group2023

Manifold Learning-Based Polynomial Chaos Expansions For High-Dimensional Surrogate Models

Ketson Roberto Maximiano Dos Santos

In this work we introduce a manifold learning-based method for uncertainty quantification (UQ) in systems describing complex spatiotemporal processes. Our first objective is to identify the embedding of a set of high-dimensional data representing quantitie ...

2022

Autoencoders reloaded

Hervé Bourlard, Selen Hande Kabil

In Bourlard and Kamp (Biol Cybern 59(4):291-294, 1998), it was theoretically proven that autoencoders (AE) with single hidden layer (previously called "auto-associative multilayer perceptrons") were, in the best case, implementing singular value decomposit ...

SPRINGER2022

Sketches, metrics and fast algorithms

Navid Nouri

As it has become easier and cheaper to collect big datasets in the last few decades, designing efficient and low-cost algorithms for these datasets has attracted unprecedented attention. However, in most applications, even storing datasets as acquired has ...

EPFL2022

Structure-Preserving Low Multilinear Rank Approximation Of Antisymmetric Tensors

Daniel Kressner

This paper is concerned with low multilinear rank approximations to antisymmetric tensors, that is, multivariate arrays for which the entries change sign when permuting pairs of indices. We show which ranks can be attained by an antisymmetric tensor and di ...

Siam Publications2017

Learning with tensors: a framework based on convex optimization and spectral regularization

Quoc Tran Dinh

We present a framework based on convex optimization and spectral regularization to perform learning when feature observations are multidimensional arrays (tensors). We give a mathematical characterization of spectral penalties for tensors and analyze a uni ...

Springer2014