Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

59118177236 · Jun 202019922001200920172026
48 results for discrete series

Paper analyzes symbolic-dynamics inspired Markov modeling for time-series data.

problem Capturing temporal patterns in sequential data for statistical learning.
method Two-step process: discretization of continuous attributes and estimation of temporal memory.
result Effective Markov modeling depends on accurate discretization and memory estimation.

Let GG be a semisimple Lie group with discrete series. We use maps K0(CrG)CK_0(C^*_rG)\to \mathbb{C} defined by orbital integrals to recover group theoretic information about GG, including information contained in KK-theory classes not associated to the discrete series. An important tool is a fixed point formula for equiv…

2018-03-20abs ↗pdf ↗

Paper develops a gradient-like proposal for discrete distributions without requiring natural differentiability.

problem Lack of natural differentiability in proposal distributions for discrete distributions.
method Locally-balanced proposal combined with Newton's series expansion for efficient exploration.
result Method guarantees convergence rate and outperforms alternatives in various experiments.

NCDSSM models irregularly sampled time series with improved imputation and forecasting.

problem Accurate modeling of irregularly sampled time series with missing observations.
method Neural Continuous-Discrete State Space Model (NCDSSM) with amortized inference for auxiliary variables and flexible dynamic state parameterizations.
result Improved imputation and forecasting performance on multiple benchmark datasets.

There is a need for the development of models that are able to account for discreteness in data, along with its time series properties and correlation. Our focus falls on INteger-valued AutoRegressive (INAR) type models. The INAR type models can be used in conjunction with existing model-based clustering techniques to …

2019-01-26abs ↗pdf ↗

This work proposes a method to learn graph structure for multivariate time series forecasting.

problem Improving multivariate time series forecasting by leveraging pairwise information.
method Learning a probabilistic graph model through optimizing mean performance over graph distribution parameterized by a neural network.
result Our method outperforms existing approaches in simplicity, efficiency, and performance.

We provide a simple way to obtain the meromorphic extension of Eisenstein series and Scattering matrices under conditions which generalize the case of discrete groups acting convex cocompactly on hyperbolic spaces.

1995-03-28abs ↗pdf ↗

We detail the theory of Discrete Riemann Surfaces. It takes place on a cellular decomposition of a surface, together with its Poincaré dual, equipped with a discrete conformal structure. A lot of theorems of the continuous theory follow through to the discrete case, we define the discrete analogs of period matrices, Ri…

2008-02-12abs ↗pdf ↗

A new RG approach connects discrete and continuous time descriptions of Gaussian processes.

problem Discretization of continuous stochastic processes for accurate simulation or model inference.
method Renormalization Group (RG) approach for Gaussian time series generated by auto-regressive models.
result RG fixed points correspond to discretizations of linear SDEs, providing insights into process accuracy.

Study shows Bergman kernels match averages on quotient spaces, proving non-vanishing of Poincaré series.

problem Proving non-vanishing of Poincaré series on finite-volume quotients of Hermitian symmetric spaces.
method Using Bergman kernels and averaging over discrete groups, proving non-vanishing of Poincaré series.
result Large class of relative Poincaré series does not vanish on general locally symmetric spaces of finite volume.

High-dimensional time series are common in many domains. Since human cognition is not optimized to work well in high-dimensional spaces, these areas could benefit from interpretable low-dimensional representations. However, most representation learning algorithms for time series data are difficult to interpret. This is…

2018-06-06abs ↗pdf ↗

NeuTSFlow models continuous functions behind time series forecasting.

problem Forecasting treats time series as discrete sequences, ignoring their continuous nature.
method NeuTSFlow uses Neural Operators to learn the transition between historical and future function families.
result NeuTSFlow outperforms traditional methods in forecasting accuracy and robustness.

In this paper we study the analytic realisation of the discrete series representations for the group G=Sp(1,1)G=Sp(1,1) as a subspace of the space of square integrable sections in a homogeneous vector bundle over the symmetric space G/K:=Sp(1,1)/(Sp(1)×Sp(1))G/K:=Sp(1,1) /(Sp(1) \times Sp(1)). We use the Szegö map to give expressions for the restric…

2007-03-27abs ↗pdf ↗

Let G0G_0 be a connected, simply connected real simple Lie group. Suppose that G0G_0 has a compact Cartan subgroup T0T_0, so it has discrete series representations. Relative to T0T_0 there is a distinguished positive root system Δ+Δ^+ for which there is a unique noncompact simple root νν, the "Borel -- de Siebenthal s…

2009-01-28abs ↗pdf ↗

GDM models time series with smoother transitions and interpretable states.

problem Capturing smooth, variable-speed transitions and stochastic mixtures of states.
method Introduces a continuous relaxation of discrete states and a Gumbel noise model.
result Models real-world datasets more faithfully with smoother dynamics and interpretable states.

This paper compares two methods for training neural ODEs in time-series regression and CNFs.

problem Training neural ODEs for time-series regression and CNFs efficiently.
method Discretize-Optimize (Disc-Opt) vs. Optimize-Discretize (Opt-Disc) approaches.
result Disc-Opt methods can achieve similar performance as Opt-Disc at inference with drastically reduced training costs.

A new method scales Gaussian process variational autoencoders to handle high-dimensional time series.

problem Scalability issue in Gaussian process variational autoencoders (GPVAEs).
method Introducing Markovian GPs and using Kalman filtering and smoothing for linear time training.
result MGPVAE outperforms existing approaches in various tasks with high scalability.

Study new symmetries in non-symmetric spaces and discontinuous groups.

problem Analyze symmetries in non-symmetric homogeneous spaces and discontinuous groups.
method Investigate discrete series, discontinuous groups, and analysis on pseudo-Riemannian spaces.
result New insights into symmetries of non-symmetric homogeneous spaces and discontinuous groups.

Neural CDEs correct errors in learned time-series models for better forecasting.

problem Error accumulation in multi-step forecasts of learned time-series models.
method Predictor-Corrector framework with a neural controlled differential equation.
result The proposed framework consistently improves forecasting performance across various models.

Let H<PSL2(Z)H<\mathrm{PSL}_2(\mathbb{Z}) be a finite index normal subgroup which is contained in a principal congruence subgroup, and let Φ(H)HΦ(H)\neq H denote a term of the lower central series or the derived series of HH. In this paper, we prove that the commensurator of Φ(H)Φ(H) in PSL2(R)\mathrm{PSL}_2(\mathbb{R}) is discrete. W…

2018-10-26abs ↗pdf ↗

Study on linear independence of Poincaré series for anti-de Sitter 3-manifolds.

problem Linear independence of generalized Poincaré series for anti-de Sitter 3-manifolds.
method Analysis of eigenfunctions and Laplacian on anti-de Sitter 3-manifolds.
result Unbounded multiplicities of eigenvalues for L2L^2-eigenfunctions and stable L2L^2-eigenvalues.

simpcomp is an extension to GAP, the well known system for computational discrete algebra. It allows the user to work with simplicial complexes. In the latest version, support for simplicial blowups and discrete normal surfaces was added, both features unique to simpcomp. Furthermore, new functions for constructing cer…

2011-05-26abs ↗pdf ↗

Survey on learning models for irregularly sampled time series data.

problem Challenges in learning from non-uniformly sampled time series data.
method Survey of recent models and architectures based on temporal discretization, interpolation, recurrence, attention, and structural invariance.
result Significant progress in machine learning for irregularly sampled time series data.

Deep learning clusters patient time-series data for better prognosis.

problem Clustering time-series data for patient phenotyping and prognosis.
method Deep predictive clustering with novel loss functions for future outcome distribution.
result Model achieves superior clustering performance and identifies meaningful patient subgroups.

This study examines how discretization improves neural forecasting models.

problem Improving predictive performance of neural forecasting models.
method Empirical investigation of data binning techniques on various neural forecasting architectures.
result Data binning almost always improves forecasting accuracy, but the type of binning is less important.

Novel SVAE learns interpretable discrete data representations from deep learning.

problem Learning interpretable discrete data representations from deep learning.
method Structured variational autoencoder (SVAE) with novel optimization algorithms.
result First competitive comparisons with state-of-the-art time series models.

This survey is based on a series of lectures that we gave at MSRI in Spring 2015 and on a series of papers, mostly written jointly with Joan Porti. Our goal here is to: 1. Describe a class of discrete subgroups Γ<GΓ<G of higher rank semisimple Lie groups, which exhibit some "rank 1 behavior". 2. Give different character…

2017-03-07abs ↗pdf ↗

Our purpose is to explore, in the context of loop ensembles on finite graphs, the relations between combinatorial group theory, loops topology, loop measures, and signatures of discrete paths. We determine the distributions of the loop homotopy class, and of the first and second homologies, defined by the lower central…

2019-08-14abs ↗pdf ↗

Estimates impulse response functions using machine learning in time series data.

problem Estimating causal effects of discrete treatments over time with flexible models.
method Double/debiased machine learning for nonparametric time series data.
result Consistent and asymptotically normal estimator for impulse response functions.

Sig-Splines model uses signatures and splines for time series data, achieving universality and convexity.

problem Creating a generative model for multivariate time series data.
method Combines linear transformations and signature transforms into a neural spline flow.
result Achieves universality and introduces convexity in model parameters.

Study on deforming discrete conformal structures on surfaces with boundaries.

problem Deforming discrete conformal structures on surfaces with boundaries.
method Introduce combinatorial Ricci flow and combinatorial Calabi flow, establish longtime existence and global convergence of solutions.
result Effective algorithms for finding discrete hyperbolic metrics on surfaces with totally geodesic boundaries of prescribed lengths.

The paper maps time-series onto networks to reveal hidden joint information.

problem Extract hidden joint information from uncorrelated time-series.
method Discretize time-series amplitudes, map onto networks, measure coupling deviations, and compare with Gaussian distributions.
result Markets may possess joint patterns even if initially uncorrelated.