English
Related papers

Related papers: Characterizing Positively Invariant Sets: Inductiv…

200 papers

We seek to establish qualitative convergence results to a general class of evolution PDEs described by gradient flows in optimal transportation distances. These qualitative convergence results come from dynamical systems under the general…

Analysis of PDEs · Mathematics 2020-10-02 J. A. Carrillo , R. S. Gvalani , J. Wu

Discovering symbolic differential equations from data uncovers fundamental dynamical laws underlying complex systems. However, existing methods often struggle with the vast search space of equations and may produce equations that violate…

Machine Learning · Computer Science 2026-03-11 Jianke Yang , Manu Bhat , Bryan Hu , Yadi Cao , Nima Dehmamy , Robin Walters , Rose Yu

In this paper, we consider an extended concept of invariant for polynomial dynamical system (PDS) with domain and initial condition, and establish a sound and complete criterion for checking semi-algebraic invariants (SAI) for such PDSs.…

Symbolic Computation · Computer Science 2011-07-22 Jiang Liu , Naijun Zhan , Hengjun Zhao

Invariant linearization criteria of square systems of second-order quadratically semi-linear ordinary differential equations (ODEs) that can be represented as geodesic equations are extended to square systems of ODEs cubically nonlinear in…

Classical Analysis and ODEs · Mathematics 2007-11-09 F. M. Mahomed , Asghar Qadir

Identifying dependency between two random variables is a fundamental problem. The clear interpretability and ability of a procedure to provide information on the form of possible dependence is particularly important when exploring…

Methodology · Statistics 2026-04-27 Bogdan Ćmiel , Teresa Ledwina

Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus involving induction and co-induction. These proof principles…

Logic in Computer Science · Computer Science 2009-09-30 Alwen Tiu , Alberto Momigliano

Given a dynamical system, a characteristic measure is a Borel probability measure invariant under all of its automorphisms. Frisch and Tamuz asked if every symbolic system supports such a measure. Motivated by this problem, we study the…

Dynamical Systems · Mathematics 2026-02-05 Solly Coles , Van Cyr , Bryna Kra , Ronnie Pavlov

The anelastic and pseudo-incompressible equations are two well-known soundproof approximations of compressible flows useful for both theoretical and numerical analysis in meteorology, atmospheric science, and ocean studies. In this paper,…

Numerical Analysis · Mathematics 2019-02-05 Werner Bauer , François Gay-Balmaz

We study causal inference in a multi-environment setting, in which the functional relations for producing the variables from their direct causes remain the same across environments, while the distribution of exogenous noises may vary. We…

Machine Learning · Computer Science 2017-05-29 AmirEmad Ghassami , Saber Salehkaleybar , Negar Kiyavash , Kun Zhang

We introduce `atomic flows': they are graphs obtained from derivations by tracing atom occurrences and forgetting the logical structure. We study simple manipulations of atomic flows that correspond to complex reductions on derivations.…

Logic · Mathematics 2015-07-01 Alessio Guglielmi , Tom Gundersen

The analysis of observable phenomena (for instance, in biology or physics) allows the detection of dynamical behaviors and, conversely, starting from a desired behavior allows the design of objects exhibiting that behavior in engineering.…

Discrete Mathematics · Computer Science 2026-04-10 Antonio E. Porreca , Marius Rolland

Flow-based generative models achieve state-of-the-art sample quality, but require the expensive solution of a differential equation at inference time. Flow map models, commonly known as consistency models, encompass many recent efforts to…

Machine Learning · Computer Science 2025-10-07 Nicholas M. Boffi , Michael S. Albergo , Eric Vanden-Eijnden

Scale invariance is a central organizing principle in physics, underlying phenomena that range from critical behaviour in statistical mechanics to transport and chaos in nonlinear dynamical systems. Here we present a unified and physically…

Statistical Mechanics · Physics 2026-02-23 Edson D. Leonel , Diego F. M. Oliveira

Bifurcation phenomena in nonlinear dynamical systems often lead to multiple coexisting stable solutions, particularly in the presence of symmetry breaking. Deterministic machine learning models are unable to capture this multiplicity,…

Machine Learning · Computer Science 2026-01-26 Fleur Hendriks , Ondřej Rokoš , Martin Doškář , Marc G. D. Geers , Vlado Menkovski

The paper introduces and studies differentially positive systems, that is, systems whose linearization along an arbitrary trajectory is positive. A generalization of Perron Frobenius theory is developed in this differential framework to…

Systems and Control · Computer Science 2014-11-12 Fulvio Forni , Rodolphe Sepulchre

We introduce a simple method to estimate the system parameters in continuous dynamical systems from the time series. In this method, we construct a modified system by introducing some constants (controlling constants) into the given…

Chaotic Dynamics · Physics 2009-11-10 P. Palaniyandi , M. Lakshmanan

Due to the non-stationarity of time series, the distribution shift problem largely hinders the performance of time series forecasting. Existing solutions either rely on using certain statistics to specify the shift, or developing specific…

Machine Learning · Computer Science 2025-02-10 Wei Fan , Shun Zheng , Pengyang Wang , Rui Xie , Kun Yi , Qi Zhang , Jiang Bian , Yanjie Fu

Modeling sets is an important problem in machine learning since this type of data can be found in many domains. A promising approach defines a family of permutation invariant densities with continuous normalizing flows. This allows us to…

Machine Learning · Computer Science 2021-07-01 Marin Biloš , Stephan Günnemann

Let $\mathcal{P}$ be a property of function $\mathbb{F}_p^n \to \{0,1\}$ for a fixed prime $p$. An algorithm is called a tester for $\mathcal{P}$ if, given a query access to the input function $f$, with high probability, it accepts when $f$…

Computational Complexity · Computer Science 2014-02-11 Yuichi Yoshida

We study the problem of learning conditional distributions of the form $p(G | \hat G)$, where $G$ and $\hat G$ are two 3D graphs, using continuous normalizing flows. We derive a semi-equivariance condition on the flow which ensures that…

Machine Learning · Computer Science 2023-04-17 Eyal Rozenberg , Daniel Freedman