Related papers: Sparse Hamburger Moment Sequences and Completions …
Explainability in time series models is crucial for fostering trust, facilitating debugging, and ensuring interpretability in real-world applications. In this work, we introduce Implet, a novel post-hoc explainer that generates accurate and…
The Hamburger moment problem for the $q$-Lommel polynomials which are related to the Hahn-Exton $q$-Bessel function is known to be indeterminate for a certain range of parameters. In this paper, the Nevanlinna parametrization for the…
We study the problem of parameter estimation for time-series possessing two, widely separated, characteristic time scales. The aim is to understand situations where it is desirable to fit a homogenized singlescale model to such multiscale…
In this paper we study a family of nonlinear (conditional) expectations that can be understood as a semimartingale with uncertain local characteristics. Here, the differential characteristics are prescribed by a time and path-dependent…
This work presents an approach to express the second moment of the completion time with a preempt-repeat model job processed on a machine subject to stochastic breakdowns by some distribution characters of the uptime, downtime and…
Many astrophysical phenomena are time-varying, in the sense that their brightness change over time. In the case of periodic stars, previous approaches assumed that changes in period, amplitude, and phase are well described by either…
Understanding the steps required to perform a task is an important skill for AI systems. Learning these steps from instructional videos involves two subproblems: (i) identifying the temporal boundary of sequentially occurring segments and…
Let n denote the number of variables and m the number of equations in a sparse polynomial system over the binary field. We study the inconsistency probability of randomly generated sparse polynomial systems over the binary field, where each…
Let $X$ be a quasi-projective variety over a number field, admitting (after passage to $\mathbb{C}$) a geometric variation of Hodge structure whose period mapping has zero-dimensional fibers. Then the integral points of $X$ are sparse: the…
We use spin-coherent states as a time-dependent variational ansatz for a semiclassical description of a large family of Heisenberg models. In addition to common approaches we also evaluate the square variance of the Hamiltonian in terms of…
We present a parameterized approach to produce personalized variable length summaries of soccer matches. Our approach is based on temporally segmenting the soccer video into 'plays', associating a user-specifiable 'utility' for each type of…
Morphic sequences form a natural class of infinite sequences, extending the well-studied class of automatic sequences. Where automatic sequences are known to have several equivalent characterizations and the class of automatic sequences is…
This paper studies the hierarchy of sparse matrix Moment-SOS relaxations for solving sparse polynomial optimization problems with matrix constraints. First, we prove a sufficient and necessary condition for the sparse hierarchy to be tight.…
We study the problem of minimizing a multivariate polynomial function over the unit hypercube. By representing the polynomial through a hypergraph and exploiting its sparsity structure, we establish a new sufficient condition under which…
The main goal of this paper is to achieve a simultaneous treatment of the even and odd truncated matricial Hamburger moment problems in the most general case. In the odd case, these results are completely new for the matrix case, whereas…
In this paper, we study the Pulsar Sequence, an integer sequence derived from Latin-square-based Pulsar puzzles introduced by the Cracking the Cryptic YouTube channel. A Pulsar puzzle consists of two interlocked spirals of circled and…
We describe Hilbert's spacefilling curve in several different ways: as an automatic sequence of directions,as a regular and synchronized sequence of coordinates of lattice points encountered, and as an automatic bitmap image.
This paper addresses the problem of video summarization. Given an input video, the goal is to select a subset of the frames to create a summary video that optimally captures the important information of the input video. With the large…
We present a convex approach to probabilistic segmentation and modeling of time series data. Our approach builds upon recent advances in multivariate total variation regularization, and seeks to learn a separate set of parameters for the…
Many problems of interest in computer science and information theory can be phrased in terms of a probability distribution over discrete variables associated to the vertices of a large (but finite) sparse graph. In recent years,…