Related papers: String Solving with Stabilization and Transducers …
Results on the problem of stabilizing a nonlinear continuous-time system by a finite number of control or measurement values are presented. The basic tool is a discontinuous version of the so-called semi-global backstepping lemma. We derive…
We examine recent claims of a large set of flux compactification solutions of string theory. We conclude that the arguments for AdS solutions are plausible. The analysis of meta-stable dS solutions inevitably leads to situations where long…
The regular spanners (characterised by vset-automata) are closed under the algebraic operations of union, join and projection, and have desirable algorithmic properties. The core spanners (introduced by Fagin, Kimelfeld, Reiss, and…
We present a detailed set of performance comparisons of two state-of-the-art solvers for the application of designing time-delay compensators, an important problem in the field of robust control. Formulating such robust control mechanics as…
Short text classification is a crucial and challenging aspect of Natural Language Processing. For this reason, there are numerous highly specialized short text classifiers. However, in recent short text research, State of the Art (SOTA)…
Optimization, a key tool in machine learning and statistics, relies on regularization to reduce overfitting. Traditional regularization methods control a norm of the solution to ensure its smoothness. Recently, topological methods have…
Stability enforcement remains a challenge in data-driven control paradigms, where no parametrised model of the system is available. For instance, the system's instabilities can be estimated in order to enforce a closed-loop stability…
It is a known fact that not all controllable systems can be asymptotically stabilized by a continuous static feedback. Several approaches have been developed throughout the last decades, including time-varying, dynamical and even…
Transducers extend finite state automata with outputs, and describe transformations from strings to strings. Sequential transducers, which have a deterministic behaviour regarding their input, are of particular interest. However, unlike…
This work presents the design of nonlinear stabilization techniques for the finite element discretization of Euler equations in both steady and transient form. Implicit time integration is used in the case of the transient form. A…
We present a new solution for fundamental problems in nonlinear dynamical systems: finding, verifying, and stabilizing cycles. The solution we propose consists of a new control method based on mixing previous states of the system (or the…
Prevalent semantic speech tokenizers, designed to capture linguistic content, are surprisingly fragile. We find they are not robust to meaning-irrelevant acoustic perturbations; even at high Signal-to-Noise Ratios (SNRs) where speech is…
We consider N strings connected to one another and forming a particular network which is a chain of strings. We study a stabilization problem and precisley we prove that the energy of the solutions of the dissipative system decay…
This article presents stability and convergence analyses of subgrid multiscale stabilized finite element formulation of non-Newtonian power-law fluid flow model strongly coupled with variable coefficients Advection-Diffusion-Reaction…
This paper uses the notion of algorithmic stability to derive novel generalization bounds for several families of transductive regression algorithms, both by using convexity and closed-form solutions. Our analysis helps compare the…
In this study, we propose new global stabilization approaches for a class of polynomial systems in both model-based and data-driven settings. The existing model-based approach guarantees global asymptotic stability of the closed-loop system…
Explicit stabilized methods are an efficient alternative to implicit schemes for the time integration of stiff systems of differential equations in large dimension. In this paper, we derive explicit stabilized integrators of orders one and…
While there have been several contributions exploring state of the art techniques for text normalization, the problem of inverse text normalization (ITN) remains relatively unexplored. The best known approaches leverage finite state…
The modular subset sum problem consists of deciding, given a modulus $m$, a multiset $S$ of $n$ integers in $0..m-1$, and a target integer $t$, whether there exists a subset of $S$ with elements summing to $t \mod m $, and to report such a…
A survey of existing methods for stopping active learning (AL) reveals the needs for methods that are: more widely applicable; more aggressive in saving annotations; and more stable across changing datasets. A new method for stopping AL…