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

Concept

Fonction itérée

Publications associées (27)

On distributional autoregression and iterated transportation

Victor Panaretos, Laya Ghodrati

We consider the problem of defining and fitting models of autoregressive time series of probability distributions on a compact interval of Double-struck capital R. An order-1 autoregressive model in this context is to be understood as a Markov chain, where ...

Wiley2024

Geometry-Driven Stock-Constrained Truss Design via Equilibrium-Based Structural Models

Corentin Jean Dominique Fivet

This paper presents a geometry-driven approach to form-finding with reused stock elements. Our proposed workflow uses a K-mean algorithm to cluster stock elements and incorporate their geometrical values early in the form-finding process. A feedback loop i ...

Springer2024

Estimation of Self-Exciting Point Processes from Time-Censored Data

Thomas Alois Weber, Philipp Jürgen Schneider

Self-exciting point processes, widely used to model arrival phenomena in nature and society, are often difficult to identify. The estimation becomes even more challenging when arrivals are recorded only as bin counts on a finite partition of the observatio ...

2023

Incremental Learning in Diagonal Linear Networks

Raphaël Jean Berthier

Diagonal linear networks (DLNs) are a toy simplification of artificial neural networks; they consist in a quadratic reparametrization of linear regression inducing a sparse implicit regularization. In this paper, we describe the trajectory of the gradient ...

Microtome Publishing2023

Improving K-means Clustering Using Speculation

Anastasia Ailamaki, Viktor Sanca, Eleni Zapridou, Stefan Igescu

K-means is one of the fundamental unsupervised data clustering and machine learning methods. It has been well studied over the years: parallelized, approximated, and optimized for different cases and applications. With increasingly higher parallelism leadi ...

2023

Exploring Novel Modalities for Optical Diffraction Tomography

Amirhossein Saba Shirvan

In the past decade, optical diffraction tomography has gained a lot of attention for its ability to create label-free three-dimensional (3D) images of the refractive index distribution of biological samples using scattered fields measured through holograph ...

EPFL2023

Analysis-aware defeaturing of complex geometries

Pablo Antolin Sanchez, Ondine Gabrielle Chanon

Local modifications of a computational domain are often performed in order to simplify the meshing process and to reduce computational costs and memory requirements. However, removing geometrical features of a domain often introduces a non-negligible error ...

2022

ADAGRAD Avoids Saddle Points

Kimon Antonakopoulos

Adaptive first-order methods in optimization are prominent in machine learning and data science owing to their ability to automatically adapt to the landscape of the function being optimized. However, their convergence guarantees are typically stated in te ...

JMLR-JOURNAL MACHINE LEARNING RESEARCH2022

Spectral properties of extended systems from Koopmans-compliant functionals

Riccardo De Gennaro

Electronic-structure simulations have been impacting the study of materials properties thanks to the simplicity of density-functional theory, a method that gives access to the ground state of the system. Although very important, ground-state properties rep ...

EPFL2022

A Majority Lemma for Randomised Query Complexity

Mika Tapani Göös, Gilbert Théodore Maystre

We show that computing the majority of n copies of a boolean function g has randomised query complexity R(Maj∘gⁿ) = Θ(n⋅R ̅_{1/n}(g)). In fact, we show that to obtain a similar result for any composed function f∘gⁿ, it suffices to prove a sufficiently stro ...

Schloss Dagstuhl - Leibniz-Zentrum für Informatik2021

Model order reduction of flow based on a modular geometrical approximation of blood vessels

Simone Deparis, Luca Pegolotti

We are interested in a reduced order method for the efficient simulation of blood flow in arteries. The blood dynamics is modeled by means of the incompressible Navier–Stokes equations. Our algorithm is based on an approximated domain-decomposition of the ...

2021

Last iterate convergence of SGD for Least-Squares in the Interpolation regime

Nicolas Henri Bernard Flammarion, Loucas Pillaud-Vivien, Aditya Vardhan Varre

Motivated by the recent successes of neural networks that have the ability to fit the data perfectly \emph{and} generalize well, we study the noiseless model in the fundamental least-squares setup. We assume that an optimum predictor fits perfectly inputs ...

Advances in Neural Information Processing Systems 20212021

Prediction of the reaction forces of spiral-groove gas journal bearings by artificial neural network regression models

Jürg Alexander Schiffmann, Elia Iseli

This paper presents neural network regression models for predicting the nonlinear static and linearized dynamic reaction forces of spiral grooved gas journal bearings. The partial differential equations (PDEs) are sampled, based on a full factorial and ran ...

2021

Analysis of the flexible boundary condition method

William Curtin, Ankit Gupta

The flexible boundary condition method (FBCM) is a well-established method for the efficient study of complex non-linear atomistic defects while avoiding finite-size effects. The method uses lattice Green's functions (LGFs) to effectively embed an atomisti ...

IOP PUBLISHING LTD2021

Walkman: A Communication-Efficient Random-Walk Algorithm for Decentralized Optimization

Ali H. Sayed, Kun Yuan

This paper introduces a new algorithm for consensus optimization in a multi-agent network, where all agents collaboratively find a minimizer for the sum of their private functions. All decentralized algorithms rely on communications between adjacent nodes. ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

A Linearly Convergent Algorithm for Decentralized Optimization: Sending Less Bits for Free!

Martin Jaggi, Anastasiia Koloskova

Decentralized optimization methods enable on-device training of machine learning models without a central coordinator. In many scenarios communication between devices is energy demanding and time consuming and forms the bottleneck of the entire system. We ...

MICROTOME PUBLISHING2020

Compress-and-restart block Krylov subspace methods for Sylvester matrix equations

Daniel Kressner, Stefano Massei, Kathryn Dianne Lund

Block Krylov subspace methods (KSMs) comprise building blocks in many state-of-the-art solvers for large-scale matrix equations as they arise, for example, from the discretization of partial differential equations. While extended and rational block Krylov ...

2020

An analytical inverse analysis to determine equi-biaxial tensile properties of strain-hardening UHPFRC from ring-on-ring test

Eugen Brühwiler, Emmanuel Denarié, Xiujiang Shen

The equi-biaxial tensile properties of strain-hardening UHPFRC are determined and investigated based on an original analytical inverse analysis of results from ring-on-ring tests. First, the analytical inverse analysis method is developed based on the elas ...

2020

Efficient management of nanomaterial hazards in a large number of research laboratories in an academic environment

Thierry Meyer, Amela Groso, Anna Maria Novello, Elina Buitrago

As the number of engineered nanomaterials (ENM) used in research increases with an incredible speed, health and safety specialists are continuously faced with the challenge of evaluating the risks involved with these materials. Nowadays there is not enough ...

2020

When Is Amplification Necessary for Composition in Randomized Query Complexity?

Mika Tapani Göös

Suppose we have randomized decision trees for an outer function f and an inner function g. The natural approach for obtaining a randomized decision tree for the composed function (f∘ gⁿ)(x¹,…,xⁿ) = f(g(x¹),…,g(xⁿ)) involves amplifying the success probabili ...

Schloss Dagstuhl - Leibniz-Zentrum für Informatik2020