Related papers: Stable approximation schemes for optimal filters
A glass is conventionally obtained by cooling a bulk supercooled liquid through its glass transition temperature. The discovery of ultrastable glasses prepared using physical vapor deposition, together with the recent multiplication of…
We study a distributed particle filter proposed by Boli\'c et al.~(2005). This algorithm involves $m$ groups of $M$ particles, with interaction between groups occurring through a "local exchange" mechanism. We establish a central limit…
In this paper, we study the individual preference (IP) stability, which is an notion capturing individual fairness and stability in clustering. Within this setting, a clustering is $\alpha$-IP stable when each data point's average distance…
This work presents a hybrid approach to solve the maximum stable set problem, using constraint and semidefinite programming. The approach consists of two steps: subproblem generation and subproblem solution. First we rank the variable…
The robustness of the stability properties of dynamical systems in the presence of unknown/adversarial perturbations to system parameters is a desirable property. In this paper, we present methods to efficiently compute and improve the…
We introduce a provably stable variant of neural ordinary differential equations (neural ODEs) whose trajectories evolve on an energy functional parametrised by a neural network. Stable neural flows provide an implicit guarantee on…
In this paper we study time semi-discrete approximations of a class of exponentially stable infinite dimensional systems with unbounded feedbacks. It has recently been proved that for time semi-discrete systems, due to high frequency…
Recently, a new approach for the stabilization of the incompressible Navier-Stokes equations for higher Reynolds numbers was introduced based on the nonlinear differential filtering of solutions on every time step of a discrete scheme. In…
This paper presents a new approach for filter design based on stochastic distances and tests between distributions. A window is defined around each pixel, overlapping samples are compared and only those which pass a goodness-of-fit test are…
We show that the ratio of matched individuals to blocking pairs grows linearly with the number of propose--accept rounds executed by the Gale--Shapley algorithm for the stable marriage problem. Consequently, the participants can arrive at…
We study the problem of finding solutions to the stable matching problem that are robust to errors in the input and we obtain a polynomial time algorithm for a special class of errors. In the process, we also initiate work on a new…
In this paper, we study the problem of estimating a Markov chain $X$(signal) from its noisy partial information $Y$, when the transition probability kernel depends on some unknown parameters. Our goal is to compute the conditional…
The Euclidean k-means problem is arguably the most widely-studied clustering problem in machine learning. While the k-means objective is NP-hard in the worst-case, practitioners have enjoyed remarkable success in applying heuristics like…
A criterion on the asymptotic stability of fractional-order systems with incomensurate orders is proposed in this paper. Existing methods always assume order parameters be rational numbers or the ratios of any two orders be rational…
Problems about attainability in topological spaces are considered. Some nonsequential version of the Warga approximate solutions is investigated: we use filters and ultrafilters of measurable spaces. Attraction sets are constructed.
This paper addresses two interrelated problems of the nonlinear filtering mechanism and fast attitude filtering with the matrix Fisher distribution (MFD) on the special orthogonal group. By analyzing the distribution evolution along Bayes'…
Optimal design of consensus acceleration graph filters relates closely to the eigenvalues of the consensus iteration matrix. This task is complicated by random networks with uncertain iteration matrix eigenvalues. Filter design methods…
We present a general framework how to investigate stability of solutions within a single self-consistent renormalization scheme being a parquet-type extension of the Baym-Kadanoff construction of conserving approximations. To obtain a…
We provide a problem definition of the stable marriage problem for a general number of parties $p$ under a natural preference scheme in which each person has simple lists for the other parties. We extend the notion of stability in a natural…
Filtering is concerned with the sequential estimation of the state, and uncertainties, of a Markovian system, given noisy observations. It is particularly difficult to achieve accurate filtering in complex dynamical systems, such as those…