Compressed classification of observation sets with linear subspace embeddings

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.

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

Predicting the evolution of systems with spatio-temporal dynamics in response to external stimuli is essential for scientific progress. Traditional equations-based approaches leverage first principles through the numerical approximation of differential equ ...

Nodal properties are of particular importance when investigating patterns in brain networks. Nodal information is usually studied by comparing a few nodal measurements (up to three), resulting in analyses in three-dimensional spaces, at maximum. We offer a ...

A key challenge across many disciplines is to extract meaningful information from data which is often obscured by noise. These datasets are typically represented as large matrices. Given the current trend of ever-increasing data volumes, with datasets grow ...

In this work, we analyze space-time reduced basis methods for the efficient numerical simulation of haemodynamics in arteries. The classical formulation of the reduced basis (RB) method features dimensionality reduction in space, while finite difference sc ...

The remarkable ability of deep learning (DL) models to approximate high-dimensional functions from samples has sparked a revolution across numerous scientific and industrial domains that cannot be overemphasized. In sensitive applications, the good perform ...

The present work proposes a framework for nonlinear model order reduction based on a Graph Convolutional Autoencoder (GCA-ROM). In the reduced order modeling (ROM) context, one is interested in obtaining real -time and many-query evaluations of parametric ...

Clustering in education, particularly in large-scale online environments like MOOCs, is essential for understanding and adapting to diverse student needs. However, the effectiveness of clustering depends on its interpretability, which becomes challenging w ...

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

Speech recognition-based applications upon the advancements in artificial intelligence play an essential role to transform most aspects of modern life. However, speech recognition in real-life conditions (e.g., in the presence of overlapping speech, varyin ...

The use of meteorological radars to study snowfall microphysical properties and processes is well established, in particular via a few distinct techniques: the use of radar polarimetry, of multi-frequency radar measurements, and of the radar Doppler spectr ...

In the current era of big data, aggregation queries on high-dimensional datasets are frequently utilized to uncover hidden patterns, trends, and correlations critical for effective business decision-making. Data cubes facilitate such queries by employing p ...

We consider the problem of learning a target function corresponding to a deep, extensive-width, non-linear neural network with random Gaussian weights. We consider the asymptotic limit where the number of samples, the input dimension and the network width ...

Unsupervised Domain Adaptation Regression (DAR) aims to bridge the domain gap between a labeled source dataset and an unlabelled target dataset for regression problems. Recent works mostly focus on learning a deep feature encoder by minimizing the discrepa ...

Tensor trains are a versatile tool to compress and work with high-dimensional data and functions. In this work we introduce the streaming tensor train approximation (STTA), a new class of algorithms for approximating a given tensor ' in the tensor train fo ...

Reduced-order models are indispensable for multi-query or real-time problems. However, there are still many challenges to constructing efficient ROMs for time-dependent parametrized problems. Using a linear reduced space is inefficient for time-dependent n ...

Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for dimensionality reduction of time-series using contrastive learning. A method can include receiving multidimensional input time series data that includes ...

Effective fall-detection and classification systems are vital in mitigating severe medical and economical consequences of falls to people in the fall risk groups. One class of such systems is based on wearable sensors. While there is a vast amount of acade ...

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

We present a general framework for portfolio risk management in discrete time, based on a replicating martingale. This martingale is learned from a finite sample in a supervised setting. Our method learns the features necessary for an effective low-dimensi ...

Compressed classification of observation sets with linear subspace embeddings

Chattez avec Graph Search

Unlabeled Principal Component Analysis and Matrix Completion

Learning the intrinsic dynamics of spatio-temporal processes through Latent Dynamics Networks

Connectome embedding in multidimensional graph spaces

Spectral Estimators for High-Dimensional Matrix Inference

SPACE-TIME REDUCED BASIS METHODS FOR PARAMETRIZED UNSTEADY STOKES EQUATIONS

Towards Trustworthy Deep Learning for Image Reconstruction

A graph convolutional autoencoder approach to model order reduction for parametrized PDEs

Interpret3C: Interpretable Student Clustering Through Individualized Feature Selection

Scalable and Privacy-Preserving Federated Principal Component Analysis

Sparse Autoencoders for Speech Modeling and Recognition

Dual-frequency spectral radar retrieval of snowfall microphysics: a physics-driven deep-learning approach

Interactive-time Exploration, Querying, and Analysis of Large High-dimensional Datasets

Bayes-optimal Learning of Deep Random Networks of Extensive-width

DARE-GRAM : Unsupervised Domain Adaptation Regression by Aligning Inverse Gram Matrices

STREAMING TENSOR TRAIN APPROXIMATION

Non-intrusive data-driven reduced-order modeling for time-dependent parametrized problems

Dimensionality reduction of time-series data, and systems and devices that use the resultant embeddings

Classification of fall directions via wearable motion sensors

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

A machine learning approach to portfolio pricing and risk management for high-dimensional problems