paper-with-me

홈 › Papers

Identification of Probability weighted ARX models with arbitrary domains

2020-09-29 · Alessandro Brusaferri, Matteo Matteucci, Stefano Spinelli

Hybrid system identification is a key tool to achieve reliable models of Cyber-Physical Systems from data. PieceWise Affine models guarantees universal approximation, local linearity and equivalence to other classes of hybrid system. Still, PWA identification is a challenging problem, requiring the concurrent solution of regression and classification tasks. In this work, we focus on the identification of PieceWise Auto Regressive with eXogenous input models with arbitrary regions (NPWARX), thus not restricted to polyhedral domains, and characterized by discontinuous maps. To this end, we propose a method based on a probabilistic mixture model, where the discrete state is represented through a multinomial distribution conditioned by the input regressors. The architecture is conceived following the Mixture of Expert concept, developed within the machine learning field. To achieve nonlinear partitioning, we parametrize the discriminant function using a neural network. Then, the parameters of both the ARX submodels and the classifier are concurrently estimated by maximizing the likelihood of the overall model using Expectation Maximization. The proposed method is demonstrated on a nonlinear piece-wise problem with discontinuous maps.

📄 PDF Abstract BibTeX arXiv:2009.13975

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Assessing the risk of re-identification arising from an attack on anonymised data

2022-03-31 · Anna Antoniou, Giacomo Dossena, Julia MacMillan, Steven Hamblin 외

Objective: The use of routinely-acquired medical data for research purposes requires the protection of patient confidentiality via data anonymisation. The objective of this work is to calculate the risk of re-identificat…

Benchmarking

Toward Provably Correct Feature Selection in Arbitrary Domains

2009-12-01 · NeurIPS 2009 12 · Dimitris Margaritis

In this paper we address the problem of provably correct feature selection in arbitrary domains. An optimal solution to the problem is a Markov boundary, which is a minimal set of features that make the probability dist…

feature selection

Approximate Inference via Weighted Rademacher Complexity

2018-01-27 · Jonathan Kuck, Ashish Sabharwal, Stefano Ermon

Rademacher complexity is often used to characterize the learnability of a hypothesis class and is known to be related to the class size. We leverage this observation and introduce a new technique for estimating the size …

LEMMA

Measuring Scalar Constructs in Social Science with LLMs

2025-09-03 · Hauke Licht, Rupak Sarkar, Patrick Y. Wu, Pranav Goel 외 arxiv

Many constructs that characterize language, like its complexity or emotionality, have a naturally continuous semantic structure; a public speech is not just "simple" or "complex," but exists on a continuum between extrem…

Best Arm Identification for Contaminated Bandits

2018-02-26 · Jason Altschuler, Victor-Emmanuel Brunel, Alan Malek

This paper studies active learning in the context of robust statistics. Specifically, we propose a variant of the Best Arm Identification problem for \emph{contaminated bandits}, where each arm pull has probability $\var…

Active Learning