Publications associées à Aggregation and Exploration of High-Dimensional Data Using the Sudokube Data Cube Engine

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

Alfio Quarteroni, Francesco Regazzoni, Stefano Pagani

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

Nature Portfolio2024

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

Sachin Basil John

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

EPFL2023

LAQy: Efficient and Reusable Query Approximations via Lazy Sampling

Anastasia Ailamaki, Periklis Chrysogelos, Viktor Sanca

Modern analytical engines rely on Approximate Query Processing (AQP) to provide faster response times than the hardware allows for exact query answering. However, existing AQP methods impose steep performance penalties as workload unpredictability increase ...

2023

STREAMING TENSOR TRAIN APPROXIMATION

Daniel Kressner

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

Siam Publications2023

Efficient GPU-accelerated Join Optimization for Complex Queries

Anastasia Ailamaki, Bikash Chandra, Srinivas Karthik Venkatesh, Riccardo Mancini, Vasileios Mageirakos

Analytics on modern data analytic and data warehouse systems often need to run large complex queries on increasingly complex database schemas. A lot of progress has been made on executing such complex queries using techniques like scale out query processin ...

IEEE2022

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

Failure and success of the spectral bias prediction for Laplace Kernel Ridge Regression: the case of low-dimensional data

Matthieu Wyart, Umberto Maria Tomasini, Antonio Sclocchi

Recently, several theories including the replica method made predictions for the generalization error of Kernel Ridge Regression. In some regimes, they predict that the method has a 'spectral bias': decomposing the true function f* on the eigenbasis of the ...

JMLR-JOURNAL MACHINE LEARNING RESEARCH2022

Sampling-Based AQP in Modern Analytical Engines

Anastasia Ailamaki, Viktor Sanca

As the data volume grows, reducing the query execution times remains an elusive goal. While approximate query processing (AQP) techniques present a principled method to trade off accuracy for faster queries in analytics, the sample creation is often consid ...

ACM2022

Characterization and prediction of peptide structures on inorganic surfaces

Dmitrii Maksimov

Interfaces between peptides and metallic surfaces are the subject of great interest for possible use in technological and medicinal applications, mainly since organic systems present an extensive range of functionalities, are abundant, cheap, and exhibit l ...

EPFL2022

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

Damir Filipovic

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

WILEY2022

Edit Based Grading of SQL Queries

Bikash Chandra

Grading student SQL queries manually is a tedious and error-prone process. Earlier work on testing correctness of student SQL queries, such as the XData system, can be used to test the correctness of a student query. However, in case a student query is fou ...

ASSOC COMPUTING MACHINERY2021

Tests of mutual independence among several random vectors using univariate and multivariate ranks of nearest neighbours

Soham Sarkar

Testing mutual independence among several random vectors of arbitrary dimensions is a challenging problem in Statistics, and it has gained considerable interest in recent years. In this article, we propose some nonparametric tests based on different notion ...

TAYLOR & FRANCIS LTD2021

Scalable Multi-Query Execution using Reinforcement Learning

Anastasia Ailamaki, Panagiotis Sioulas

The growing demand for data-intensive decision support and the migration to multi-tenant infrastructures put databases under the stress of high analytical query load. The requirement for high throughput contradicts the traditional design of query-at-a-time ...

Association for Computing Machinery2021

Landscape and training regimes in deep learning

Mario Geiger, Matthieu Wyart, Leonardo Petrini

Deep learning algorithms are responsible for a technological revolution in a variety oftasks including image recognition or Go playing. Yet, why they work is not understood.Ultimately, they manage to classify data lying in high dimension – a feat generical ...

2021

Video Prediction Recalling Long-term Motion Context via Memory Alignment Learning

Hakgu Kim

Our work addresses long-term motion context issues for predicting future frames. To predict the future precisely, it is required to capture which long-term motion context (e.g., walking or running) the input motion (e.g., leg movement) belongs to. The bott ...

IEEE COMPUTER SOC2021

A Real-time Synchrophasor Data Compression Method Using Singular Value Decomposition

Mario Paolone

The proliferation of phasor measurement units (PMUs) presents new challenges in archiving and processing large amounts of synchrophasor data which necessitates advanced data compression methods. This paper proposes a singular value decomposition (SVD)-base ...

2021

On Perfect Clustering of High Dimension, Low Sample Size Data

Soham Sarkar

Popular clustering algorithms based on usual distance functions (e.g., the Euclidean distance) often suffer in high dimension, low sample size (HDLSS) situations, where concentration of pairwise distances and violation of neighborhood structure have advers ...

IEEE COMPUTER SOC2020

Chemiscope: interactive structure-property explorer for materials and molecules

Michele Ceriotti, Guillaume André Jean Fraux

The number of materials or molecules that can be created by combining different chemical elements in various proportions and spatial arrangements is enormous. Computational chemistry can be used to generate databases containing billions of potential struct ...

2020

Common Information Components Analysis

Michael Christoph Gastpar, Erixhen Sula

We give an information-theoretic interpretation of Canonical Correlation Analysis (CCA) via (relaxed) Wyner's common information. CCA permits to extract from two high-dimensional data sets low-dimensional descriptions (features) that capture the commonalit ...

IEEE2020

On some graph-based two-sample tests for high dimension, low sample size data

Soham Sarkar

Testing for equality of two high-dimensional distributions is a challenging problem, and this becomes even more challenging when the sample size is small. Over the last few decades, several graph-based two-sample tests have been proposed in the literature, ...

SPRINGER2020