English
Related papers

Related papers: Decoupled algorithms for non-linearly coupled reac…

200 papers

We propose and analyse numerical schemes for a system of quasilinear, degenerate evolution equations modelling biofilm growth as well as other processes such as flow through porous media and the spreading of wildfires. The first equation in…

Numerical Analysis · Mathematics 2024-04-05 R. K. H. Smeets , K. Mitra , I. S. Pop , S. Sonner

In this paper, we develop a novel distributed algorithm for addressing convex optimization with both nonlinear inequality and linear equality constraints, where the objective function can be a general nonsmooth convex function and all the…

Optimization and Control · Mathematics 2021-02-26 Xuyang Wu , He Wang , Jie Lu

We analyze the optimal harvesting problem for an ecosystem of species that experience environmental stochasticity. Our work generalizes the current literature significantly by taking into account non-linear interactions between species,…

Probability · Mathematics 2019-08-28 Alexandru Hening , Ky Quan Tran , Tien Trong Phan , George Yin

Diffusion models over discrete spaces have recently shown striking empirical success, yet their theoretical foundations remain incomplete. In this paper, we study the sampling efficiency of score-based discrete diffusion models under a…

Machine Learning · Computer Science 2026-02-17 Daniil Dmitriev , Zhihan Huang , Yuting Wei

This paper addresses the problem of learning the optimal control policy for a nonlinear stochastic dynamical system with continuous state space, continuous action space and unknown dynamics. This class of problems are typically addressed in…

Machine Learning · Computer Science 2019-04-18 Ran Wang , Karthikeya Parunandi , Dan Yu , Dileep Kalathil , Suman Chakravorty

Here we present an investigation into using nested sampling algorithms in cosmological likelihood analysis. We present a new nested sampling algorithm, ESNested, that uses Evolution Strategies for sample proposals. This quickly finds the…

Cosmology and Nongalactic Astrophysics · Physics 2011-01-28 M. Axiak , T. D. Kitching , J. I. van Hemert

This paper considers distributed resource allocation and sum-preserving constrained optimization over lossy networks, where the links are unreliable and subject to packet drops. We define the conditions to ensure convergence under packet…

Systems and Control · Electrical Eng. & Systems 2022-08-31 Mohammadreza Doostmohammadian , Usman A. Khan , Alireza Aghasi , Themistoklis Charalambous

We consider the simulation of distributions that are a mixture of discrete and continuous components. We extend a Metropolis-Hastings-based perfect sampling algorithm of Corcoran and Tweedie to allow for a broader class of transition…

Methodology · Statistics 2012-02-02 Wenjin Mao , Jem Corcoran

Discrete time, spatially extended models play an important role in ecology, modelling population dynamics of species ranging from micro-organisms to birds. An important question is how 'bottom up', individual-based models can be…

Populations and Evolution · Quantitative Biology 2023-01-20 Linnéa Gyllingberg , David J. T. Sumpter , Åke Brännström

Self- and cross-diffusion are important nonlinear spatial derivative terms that are included into biological models of predator-prey interactions. Self-diffusion models overcrowding effects, while cross-diffusion incorporates the response…

Numerical Analysis · Mathematics 2024-12-20 Matthew A. Beauregard , Joshua L. Padgett

In this paper we consider large-scale smooth optimization problems with multiple linear coupled constraints. Due to the non-separability of the constraints, arbitrary random sketching would not be guaranteed to work. Thus, we first…

Optimization and Control · Mathematics 2018-08-09 Ion Necoara , Martin Takac

We present a novel multiscale simulation approach for modeling stochasticity in chemical reaction networks. The approach seamlessly integrates exact-stochastic and "leaping" methodologies into a single "partitioned leaping" algorithmic…

Chemical Physics · Physics 2009-11-11 Leonard A. Harris , Paulette Clancy

This paper gives poly-logarithmic-round, distributed D-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-cost Covering). The approximation ratio D is the maximum number of…

Data Structures and Algorithms · Computer Science 2020-05-29 Christos Koufogiannakis , Neal E. Young

Distributed locking mechanisms are fundamental to ensuring data consistency and integrity in distributed systems. This paper presents a comprehensive analysis of distributed locking algorithms, focusing on their performance characteristics…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-04-07 Andre Rodriguez , William Osborn

We propose a deterministic denoising algorithm for discrete-state diffusion models. The key idea is to derandomize the generative reverse Markov chain by introducing a variant of the herding algorithm, which induces deterministic state…

Machine Learning · Computer Science 2026-01-30 Hideyuki Suzuki , Wataru Kurebayashi , Hiroshi Yamashita

This paper presents a distributed model predictive control (DMPC) scheme for nonlinear continuous-time systems. The underlying distributed optimal control problem is cooperatively solved in parallel via a sensitivity-based algorithm. The…

Optimization and Control · Mathematics 2024-06-06 Maximilian Pierer von Esch , Andreas Völz , Knut Graichen

We develop the no-propagate algorithm for sampling the linear response of random dynamical systems, which are non-uniform hyperbolic deterministic systems perturbed by noise with smooth density. We first derive a Monte-Carlo type formula…

Dynamical Systems · Mathematics 2023-08-16 Angxiu Ni

Matching pursuit algorithms are an important class of algorithms in signal processing and machine learning. We present a blended matching pursuit algorithm, combining coordinate descent-like steps with stronger gradient descent steps, for…

Optimization and Control · Mathematics 2019-11-21 Cyrille W. Combettes , Sebastian Pokutta

For an arbitrary initial configuration of discrete loads over vertices of a distributed graph, we consider the problem of minimizing the {\em discrepancy} between the maximum and minimum loads among all vertices. For this problem, this…

Data Structures and Algorithms · Computer Science 2018-05-15 Takeharu Shiraga

In this work, we study how to efficiently obtain perfect samples from a discrete distribution $\mathcal{D}$ given access only to pairwise comparisons of elements of its support. Specifically, we assume access to samples $(x, S)$, where $S$…

Machine Learning · Computer Science 2023-02-28 Dimitris Fotakis , Alkis Kalavasis , Christos Tzamos