Related papers: On the Normalized Spectral Representation of Max-S…
A class of discrete event synthesis problems can be reduced to solving language equations f . X ⊆ S, where F is the fixed component and S the specification. Sequential synthesis deals with FSMs when the automata for F and S are prefix…
The spectral density function describes the second-order properties of a stationary stochastic process on $\mathbb{R}^d$. This paper considers the nonparametric estimation of the spectral density of a continuous-time stochastic process…
The spectral representation is an effecient tool to explore electrical properties of material mixtures. It separates the contributions of geometrical topology and intrinsic properties of the constituents in the system. The aim of this paper…
We study how maximal regularity estimates with respect to the continuous functions improve automatically in cases where the spatial norm is fundamentally different from the supremum norm. More precisely, we invoke properties such as weak…
Simulation Optimization (SO) refers to the optimization of an objective function subject to constraints, both of which can be evaluated through a stochastic simulation. To address specific features of a particular simulation---discrete or…
Inspired by biology, spiking neural networks (SNNs) process information via discrete spikes over time, offering an energy-efficient alternative to the classical computing paradigm and classical artificial neural networks (ANNs). In this…
The normalized maximized likelihood (NML) provides the minimax regret solution in universal data compression, gambling, and prediction, and it plays an essential role in the minimum description length (MDL) method of statistical modeling…
We characterize all possible independent symmetric alpha-stable (SaS) components of an SaS process, 0<alpha<2. In particular, we focus on stationary SaS processes and their independent stationary SaS components. We also develop a parallel…
We propose a new iterative unfolding method for experimental data, making use of a regularization function. The use of this function allows one to build an improved normalization procedure for Monte Carlo spectra, unbiased by the presence…
Compact representations of objects is a common concept in computer science. Automated planning can be viewed as a case of this concept: a planning instance is a compact implicit representation of a graph and the problem is to find a path (a…
Self-stabilization is a general paradigm to provide forward recovery capabilities to distributed systems and networks. Intuitively, a protocol is self-stabilizing if it is able to recover without external intervention from any catastrophic…
Method of moment estimators exhibit appealing statistical properties, such as asymptotic unbiasedness, for nonconvex problems. However, they typically require a large number of samples and are extremely sensitive to model misspecification.…
This paper introduces a generalised 3rd-order Spectral Representation Method for the simulation of multi-dimensional stochastic fields with asymmetric non-linearities. The simulated random fields satisfy a prescribed Power Spectrum and…
Recent work on the representation of functions on sets has considered the use of summation in a latent space to enforce permutation invariance. In particular, it has been conjectured that the dimension of this latent space may remain fixed…
The Complex Scaling Method (CSM) provides scattering wave functions which regularize resonances and suggest a resolution of the identity in terms of such resonances, completed by the bound states and a smoothed continuum. But, in the case…
X-ray spectroscopy is a powerful technique for the analysis of the energy distribution of X-rays from astrophysical sources. It allows for the study of the properties, composition, and physical processes taking place at the site of…
We experimentally demonstrated a spectral imaging scheme with dual compressed sensing. With the dimensions of spectral and spatial information both compressed, the spectral image of a colored object can be obtained with only a single point…
We introduce two min-max problems: the first problem is to minimize the supremum of finitely many rational functions over a compact basic semi-algebraic set whereas the second problem is a 2-player zero-sum polynomial game in randomized…
Inspired by regularization techniques in statistics and machine learning, we study complementary composite minimization in the stochastic setting. This problem corresponds to the minimization of the sum of a (weakly) smooth function endowed…
Many problems in causal inference and economics can be formulated in the framework of conditional moment models, which characterize the target function through a collection of conditional moment restrictions. For nonparametric conditional…