相关论文: When can forward stable algorithms be composed sta…
Stacking is a general approach for combining multiple models toward greater predictive accuracy. It has found various application across different domains, ensuing from its meta-learning nature. Our understanding, nevertheless, on how and…
In stable matching, one must find a matching between two sets of agents, commonly men and women, or job applicants and job positions. Each agent has a preference ordering over who they want to be matched with. Moreover a matching is said to…
Given an infinitesimal perturbation of a discrete-time finite Markov chain, we seek the states that are stable despite the perturbation, \textit{i.e.} the states whose weights in the stationary distributions can be bounded away from $0$ as…
We introduce the notion of a stable instance for a discrete optimization problem, and argue that in many practical situations only sufficiently stable instances are of interest. The question then arises whether stable instances of NP--hard…
We analyze the stability under time evolution of complexifier coherent states (CCS) in one-dimensional mechanical systems. A system of coherent states is called stable if it evolves into another coherent state. It turns out that a system…
When is a nonlinear filter stable with respect to its initial condition? In spite of the recent progress, this question still lacks a complete answer in general. Currently available results indicate that stability of the filter depends on…
This paper is devoted to the theoretical study of the efficiency, namely, stability of some greedy algorithms. In the greedy approximation theory researchers are mostly interested in the following two important properties of an algorithm --…
Herman's self-stabilisation algorithm, introduced 25 years ago, is a well-studied synchronous randomised protocol for enabling a ring of $N$ processes collectively holding any odd number of tokens to reach a stable state in which a single…
We describe stability conditions for pairs consisting of a coherent sheaf and a homomorphism to a fixed coherent sheaf on a projective variety. The corresponding moduli spaces are constructed for pairs on curves and surfaces. We consider…
We derive the precise stability criterion for smooth solitary waves in the b-family of Camassa-Holm equations. The smooth solitary waves exist on the constant background. In the integrable cases b = 2 and b = 3, we show analytically that…
Homological stability has shown itself to be a powerful tool for the computation of homology of families of groups such as general linear groups, mapping class groups or automorphisms of free groups. We survey here tools and techniques for…
We study stable matchings that are robust to preference changes in the two-sided stable matching setting of Gale and Shapley [GS62]. Given two instances $A$ and $B$ on the same set of agents, a matching is said to be robust if it is stable…
A probabilistic approach to the stable matching problem has been identified as an important research area with several important open problems. When considering random matchings, ex-post stability is a fundamental stability concept. A…
There is a well studied notion of GIT-stability for coherent systems over curves, which depends on a real parameter $\alpha$. For generated coherent systems, there is a further notion of stability derived from Mumford's definition of linear…
Designing a language feature often requires a choice between several, similarly expressive possibilities. Given that user studies are generally impractical, we propose using stability as a way of making such decisions. Stability is a…
We consider the stable assignment problem on a graph with nonnegative real capacities on the edges and quotas on the vertices, in which the preferences of agents are given via diversifying choice functions. We prove that for any input of…
In this work, we present and analyze the numerical stability of two coupled finite element formulations. The first one is the h-a-formulation and is well suited for modeling systems with superconductors and ferromagnetic materials. The…
The study of stable matchings usually relies on the assumption that agents' preferences over the opposite side are complete and known. In many real markets, however, preferences might be uncertain and revealed only through costly…
In this paper we establish the stability of the functional equation \begin{equation*}f(xy)=f(x)g(y)+g(x)f(y)+h(x)h(y),\;x,y\in G,\end{equation*} where $G$ is an amenable group.
In this paper we establish the stability of the functional equation $$f(x-y)=f(x)g(y)+g(x)f(y)+h(x)h(y)),\;\; x,y \in G, $$where $G$ is an abelian group.