Show newer

Bayesian inference for geophysical fluid dynamics using generative models arxiv.org/abs/2411.04140

Bayesian inference for geophysical fluid dynamics using generative models

Data assimilation plays a crucial role in numerical modeling, enabling the integration of real-world observations into mathematical models to enhance the accuracy and predictive capabilities of simulations. This approach is widely applied in fields such as meteorology, oceanography, and environmental science, where the dynamic nature of systems demands continuous updates to model states. However, the calibration of models in these high-dimensional, nonlinear systems poses significant challenges. In this paper, we explore a novel calibration methodology using diffusion generative models. We generate synthetic data that statistically aligns with a given set of observations (in this case the increments of the numerical approximation of a solution of a partial differential equation). This allows us to efficiently implement a model reduction and assimilate data from a reference system state modeled by a highly resolved numerical solution of the rotating shallow water equation of order 104 degrees of freedom into a stochastic system having two orders of magnitude less degrees of freedom. To do so, the new samples are incorporated into a particle filtering methodology augmented with tempering and jittering for dynamic state estimation, a method particularly suited for handling complex and multimodal distributions. This work demonstrates how generative models can be used to improve the predictive accuracy for particle filters, providing a more computationally efficient solution for data assimilation and model calibration.

arXiv.org

A Capacitated Collection-and-Delivery-Point Location Problem with Random Utility Maximizing Customers arxiv.org/abs/2411.04200

A Capacitated Collection-and-Delivery-Point Location Problem with Random Utility Maximizing Customers

We consider a strategic decision-making problem where a logistics provider (LP) seeks to locate collection and delivery points (CDPs) with the objective to reduce total logistics costs. The customers maximize utility that depends on their perception of home delivery service as well as the characteristics of the CDPs, including their location. At the strategic planning level, the LP does not have complete information about customers' preferences and their exact location. We introduce a mixed integer non-linear formulation of the problem and propose two linear reformulations. The latter involve sample average approximations and closest assignment constraints, and in one of the formulations we use scenario aggregation to reduce its size. We solve the formulations with a general-purpose solver using a standard Benders decomposition method. Based on extensive computational results and a realistic case study, we find that the problem can be solved efficiently. However, the level of uncertainty in the instances determines which approach is the most efficient. We use an entropy measure to capture the level of uncertainty that can be computed prior to solving. Furthermore, the results highlight the value of accurate demand modeling, as customer preferences have an important impact on the solutions and associated costs.

arXiv.org

On the fractional relaxation equation with Scarpi derivative arxiv.org/abs/2411.03317

Supplementary Private Tutoring and Mathematical Achievements in Higher Education: An Empirical Study on Linear Algebra arxiv.org/abs/2411.03332

The Bohr's Phenomenon for the class of K-quasiconformal harmonic mappings arxiv.org/abs/2411.03352

Exponential actions defined by vector configurations, Gale duality, and moment-angle manifolds arxiv.org/abs/2411.03366

Near-Optimal and Tractable Estimation under Shift-Invariance arxiv.org/abs/2411.03383

Near-Optimal and Tractable Estimation under Shift-Invariance

How hard is it to estimate a discrete-time signal $(x_{1}, ..., x_{n}) \in \mathbb{C}^n$ satisfying an unknown linear recurrence relation of order $s$ and observed in i.i.d. complex Gaussian noise? The class of all such signals is parametric but extremely rich: it contains all exponential polynomials over $\mathbb{C}$ with total degree $s$, including harmonic oscillations with $s$ arbitrary frequencies. Geometrically, this class corresponds to the projection onto $\mathbb{C}^{n}$ of the union of all shift-invariant subspaces of $\mathbb{C}^\mathbb{Z}$ of dimension $s$. We show that the statistical complexity of this class, as measured by the squared minimax radius of the $(1-δ)$-confidence $\ell_2$-ball, is nearly the same as for the class of $s$-sparse signals, namely $O\left(s\log(en) + \log(δ^{-1})\right) \cdot \log^2(es) \cdot \log(en/s).$ Moreover, the corresponding near-minimax estimator is tractable, and it can be used to build a test statistic with a near-minimax detection threshold in the associated detection problem. These statistical results rest upon an approximation-theoretic one: we show that finite-dimensional shift-invariant subspaces admit compactly supported reproducing kernels whose Fourier spectra have nearly the smallest possible $\ell_p$-norms, for all $p \in [1,+\infty]$ at once.

arXiv.org
Show older
Qoto Mastodon

QOTO: Question Others to Teach Ourselves
An inclusive, Academic Freedom, instance
All cultures welcome.
Hate speech and harassment strictly forbidden.