Parameter Identification to Enforce Practical Observability of Nonlinear Systems

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.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Parameter Identification to Enforce Practical Observability of Nonlinear Systems

Chattez avec Graph Search

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

Robust Optimization for Product Line Design

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

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

Efficient Online Clustering with Moving Costs

Data-driven modeling of beam loss in the LHC

Universal and adaptive methods for robust stochastic optimization

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

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

Updates on Hydrogen Value Chain: A Strategic Roadmap

Augmented Lagrangian Methods for Provable and Scalable Machine Learning

Stochastic adaptive resampling for the estimation of discrete choice models

The complexity of quantum support vector machines

Improving K-means Clustering Using Speculation

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

Efficient Preparation of Cyclic Quantum States

Resampling estimation of discrete choice models

Memory of Motion for Initializing Optimization in Robotics

Data-Driven Unknown-Input Observers and State Estimation

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