Publications associées à Parameter Identification to Enforce Practical Observability of Nonlinear Systems

The complexity of quantum support vector machines

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

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

Maxime Jean Julien Peyrard, Robert West, 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

On the use of Cramér-Rao Lower Bound for least-variance circuit parameters identification of Li-ion cells

Mario Paolone, Vladimir Sovljanski

Electrochemical Impedance Spectroscopy (EIS) and Equivalent Circuit Models (ECMs) are widely used to characterize the impedance and estimate parameters of electrochemical systems such as batteries. We use a generic ECM with ten parameters grouped to model ...

2024

Augmented Memory: Sample-Efficient Generative Molecular Design with Reinforcement Learning

Philippe Schwaller, Jeff Guo

Sample efficiency is a fundamental challenge in de novo molecular design. Ideally, molecular generative models should learn to satisfy a desired objective under minimal calls to oracles (computational property predictors). This problem becomes more apparen ...

Amer Chemical Soc2024

Optimizing Quantum Compilers: Efficient and Effective Algorithms

Fereshte Mozafari Ghoraba

Quantum computing has made significant progress in recent years, with Google and IBM releasing quantum computers with 72 and 50 qubits, respectively. Google has also achieved quantum supremacy with its 54-qubit device, and IBM has announced the release of ...

EPFL2023

Deep learning-based solid component measuring enabled interpretable prediction of tumor invasiveness for lung adenocarcinoma

Xinchao Wang, Hua Sun, Li Zhang, Jiancheng Yang

Background: The nature of the solid component of subsolid nodules (SSNs) can indicate tumor pathological invasiveness. However, preoperative solid component assessment still lacks a reference standard.Methods: In this retrospective study, an AI algorithm w ...

Elsevier Ireland Ltd2023

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, Loïc Thomas Davies Coyle, Ekaterina Krymova

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

Philipp Schneider, Thomas Alois Weber

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, Nicola Marco Ortelli, Matthieu Marie Cochon de Lapparent

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

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

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

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

Modeling and mitigating supply chain disruptions as a bilevel network flow problem

Ralf Seifert, Anna Timonina-Farkas, René Yves Glogg

Years of globalization, outsourcing and cost cutting have increased supply chain vulnerability calling for more effective risk mitigation strategies. In our research, we analyze supply chain disruptions in a production setting. Using a bilevel optimization ...

2022

Optimal Matching of Random Parts

Thomas Alois Weber

This paper examines the minimization of the cost for an expected random production output, given an assembly of finished goods from two random inputs, matched in two categories. We describe the optimal input portfolio, first using the standard normal appro ...

2022