Publications related to Parameter Identification to Enforce Practical Observability of Nonlinear Systems

Related publications (38)

Scalable kernel logistic regression with Nyström approximation: Theoretical analysis and application to discrete choice modelling

The application of kernel-based Machine Learning (ML) techniques to discrete choice modelling using large datasets often faces challenges due to memory requirements and the considerable number of parameters involved in these models. This complexity hampers ...

2025

Robust Optimization for Product Line Design

Jun Han

In order to extract maximum surplus from a heterogeneous customer base it is common practice for firms to offer a portfolio of differentiated products, from which consumers of different preferences can select their favorite items. The standard model of pro ...

EPFL2025

K-space physics-informed neural network (k-PINN) for compressed spectral mapping and efficient inversion of vibrations in thin composite laminates

Olga Fink

The vibrational response of structural components carries valuable information about their underlying mechanical properties, health status and operational conditions. This underscores the need for the development of efficient physics-based inversion algori ...

Elsevier BV2025

Overcoming Distribution Shifts and Imbalance Challenges in Representation Learning for Deep Regression Models

Ismail Nejjar

Deep learning has shown remarkable potential for industrial applications, particularly in predictive maintenance and condition monitoring. A key challenge in this domain is prognostics, specifically predicting the Remaining Useful Life (RUL) of assets - a ...

EPFL2025

On the Perspectives of Image-to-Lidar Constraints in Dynamic Network Optimisation

Thibaut Stoltz, Jan Skaloud, Davide Antonio Cucci, Laurent Valentin Jospin, Kyriaki Mouzakidou

The evolution of airborne mapping witnesses the introduction of hybrid lidar-camera systems to enhance data collection, i.e. to obtain simultaneously high-density point-cloud and texture. Yet, the common adjustment of both optical data streams is a nontriv ...

International Society for Photogrammetry and Remote Sensing2025

Efficient Online Clustering with Moving Costs

Volkan Cevher, Efstratios Panteleimon Skoulakis

In this work we consider an online learning problem, called Online k-Clustering with Moving Costs, at which a learner maintains a set of k facilities over T rounds so as to minimize the connection cost of an adversarially selected sequence of clients. The ...

2023

Data-driven modeling of beam loss in the LHC

Tatiana Pieloni, Michael Schenk, Ekaterina Krymova, Loïc Thomas Davies Coyle

In the Large Hadron Collider, the beam losses are continuously measured for machine protection. By design, most of the particle losses occur in the collimation system, where the particles with high oscilla-tion amplitudes or large momentum error are scrape ...

FRONTIERS MEDIA SA2023

Universal and adaptive methods for robust stochastic optimization

Ali Kavis

Within the context of contemporary machine learning problems, efficiency of optimization process depends on the properties of the model and the nature of the data available, which poses a significant problem as the complexity of either increases ad infinit ...

EPFL2023

Wind farm power density optimization according to the area size using a novel self-adaptive genetic algorithm

Fernando Porté Agel, Nicolas Otto Kirchner Bossi

This work studies the power density (PD) optimization in wind farms, and its sensitivity to the available area size. A novel genetic algorithm (PDGA) is introduced, which optimizes PD and the turbine layout, by self-adapting to the PD and to the solutions ...

Pergamon-Elsevier Science Ltd2023

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

Updates on Hydrogen Value Chain: A Strategic Roadmap

Michael Graetzel, Dan Ren

A strategic roadmap for noncarbonized fuels is a global priority, and the reduction of carbon dioxide emissions is a key focus of the Paris Agreement to mitigate the effects of rising temperatures. In this context, hydrogen is a promising noncarbonized fue ...

WILEY-V C H VERLAG GMBH2023

Augmented Lagrangian Methods for Provable and Scalable Machine Learning

Mehmet Fatih Sahin

Non-convex constrained optimization problems have become a powerful framework for modeling a wide range of machine learning problems, with applications in k-means clustering, large- scale semidefinite programs (SDPs), and various other tasks. As the perfor ...

EPFL2023

Stochastic adaptive resampling for the estimation of discrete choice models

Michel Bierlaire, Matthieu Marie Cochon de Lapparent, Nicola Marco Ortelli

In the field of choice modeling, the availability of ever-larger datasets has the potential to significantly expand our understanding of human behavior, but this prospect is limited by the poor scalability of discrete choice models (DCMs): as sample sizes ...

2023

The complexity of quantum support vector machines

Gian Florin Gentinetta

Quantum support vector machines employ quantum circuits to define the kernel function. It has been shown that this approach offers a provable exponential speedup compared to any known classical algorithm for certain data sets. The training of such models c ...

Verein Forderung Open Access Publizierens Quantenwissenschaf2024

Improving K-means Clustering Using Speculation

Stefan Igescu, Anastasia Ailamaki, Viktor Sanca, Eleni Zapridou

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

Fly-Swat or Cannon? Cost-Effective Language Model Choice via Meta-Modeling

Robert West, Maxime Jean Julien Peyrard, Marija Sakota

Generative language models (LMs) have become omnipresent across data science. For a wide variety of tasks, inputs can be phrased as natural language prompts for an LM, from whose output the solution can then be extracted. LM performance has consistently be ...

Assoc Computing Machinery2024

Efficient Preparation of Cyclic Quantum States

Giovanni De Micheli, Fereshte Mozafari Ghoraba

Universal quantum algorithms that prepare arbitrary n-qubit quantum states require O(2n) gate complexity. The complexity can be reduced by considering specific families of quantum states depending on the task at hand. In particular, multipartite quantum st ...

IEEE2022

Resampling estimation of discrete choice models

Michel Bierlaire, Matthieu Marie Cochon de Lapparent, Nicola Marco Ortelli

In the context of discrete choice modeling, the extraction of potential behavioral insights from large datasets is often limited by the poor scalability of maximum likelihood estimation. This paper proposes a simple and fast dataset-reduction method that i ...

2024

Memory of Motion for Initializing Optimization in Robotics

Teguh Santoso Lembono

Many robotics problems are formulated as optimization problems. However, most optimization solvers in robotics are locally optimal and the performance depends a lot on the initial guess. For challenging problems, the solver will often get stuck at poor loc ...

EPFL2022

Data-Driven Unknown-Input Observers and State Estimation

Giancarlo Ferrari Trecate, Mustafa Sahin Turan

Unknown-input observers (UIOs) allow for estimation of the states of an LTI system without knowledge of all inputs. In this letter, we provide a novel data-driven UIO based on behavioral system theory and the result known as Fundamental Lemma proposed by J ...

2022