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,657 papers · 148 categories

Trend · papers per month

2845688511,135 · Jun 202019922001200920172026
48 results for Irregular Spatial Data

Graph neural networks extend neural Bayes estimators to irregular spatial data.

problem Estimating parameters from irregular spatial data with computational efficiency.
method Employing graph neural networks to approximate Bayes estimators for irregular spatial data.
result Extending neural Bayes estimation to irregular spatial data with computational benefits.

Neural networks improve geospatial data analysis by relaxing linearity assumptions.

problem Traditional geospatial analysis assumes linear models, limiting flexibility.
method Embedding neural networks within traditional geostatistical models for non-linear mean functions.
result NN-GLS algorithm provides consistent and scalable predictions for irregular spatial data.

A framework uses deep learning for spatio-temporal data prediction.

problem Interpolation of continuous spatio-temporal fields on irregular points.
method Decomposes spatio-temporal processes into products of basis functions and spatial coefficients.
result Effectiveness in reconstructing coherent spatio-temporal fields.

TK-GCN forecasts spatiotemporal dynamics using Koopman-enhanced graph convolutional networks.

problem Forecasting complex spatiotemporal dynamics over irregular domains.
method Two-stage framework: Koopman-enhanced Graph Convolutional Network (K-GCN) for spatial encoding and Transformer for temporal modeling.
result TK-GCN outperforms state-of-the-art methods in spatiotemporal cardiac dynamics forecasting.

DET unifies geometric and functional alignment for high-dimensional scientific data.

problem Challenges in nonrigid registration for high-dimensional, irregular data.
method Domain Elastic Transform (DET) treats data as functions on irregular domains, using a Bayesian framework for elastic motion registration.
result DET achieves 92% topological preservation on MERFISH data and successfully registers whole-embryo Stereo-seq atlases.

Paper tackles estimating initial conditions of spatio-temporal processes from sparse data.

problem Estimating initial conditions of spatio-temporal advection-diffusion processes from sparse data.
method Regularized convex optimization problem with Alternating Direction Method of Multipliers.
result Efficient solutions for non-uniform and shifted uniform sampling schemes.

Detecting weak clustered signal in spatial data is important but challenging in applications such as medical image and epidemiology. A more efficient detection algorithm can provide more precise early warning, and effectively reduce the decision risk and cost. To date, many methods have been developed to detect signals…

2019-04-05abs ↗pdf ↗

We provide a computationally and statistically efficient method for estimating the parameters of a stochastic covariance model observed on a regular spatial grid in any number of dimensions. Our proposed method, which we call the Debiased Spatial Whittle likelihood, makes important corrections to the well-known Whittle…

2019-07-04abs ↗pdf ↗

daep learns from irregular, multimodal astronomical data.

problem Learning from irregular, multimodal astronomical sequences.
method Diffusion Autoencoder with Perceivers (daep) tokenizes, compresses, and reconstructs data.
result daep outperforms VAE and maep baselines in reconstruction and fine-scale structure preservation.

EDICT learns evidential distributions for irregular time series, improving predictions and uncertainty quantification.

problem Challenges in predicting and characterizing uncertainty for irregular time series data.
method EDICT (Evidential Distributions for Irregular Time Series) learns a continuous-time evidential distribution.
result EDICT achieves competitive performance on time series classification tasks and provides better uncertainty quantification.

ACSSM models irregular time series with continuous dynamics.

problem Modeling irregular time series data.
method ACSSM uses a multi-marginal Doob's h-transform and variational inference with stochastic optimal control.
result ACSSM outperforms in tasks like classification, regression, interpolation, and extrapolation.

CRUs model irregular time series with continuous hidden states.

problem Handling irregular time intervals in sequential data.
method Continuous Recurrent Units (CRUs) that integrate hidden states via a linear stochastic differential equation.
result CRUs outperform methods based on neural ordinary differential equations in irregular time series interpolation.

LOT framework embeds high-dimensional cell data into interpretable Euclidean space.

problem Lack of interpretable methods for high-dimensional cell data.
method Adapts Linear Optimal Transport (LOT) to irregular point clouds.
result Accurate and interpretable classification and synthetic data generation.

Paper connects Painlevé VI equation to irregular systems, solving monodromy data.

problem Solving monodromy data for irregular systems related to Painlevé VI.
method Expressed Frobenius integrability in terms of PVI, computed monodromy data for coalescing eigenvalues.
result Computed monodromy data for transcendentals holomorphic at critical points of PVI.

Paper develops a method for causal representation learning from irregular tensors.

problem Complex patterns in high-dimensional, irregular tensor data.
method Novel causal formulation and CaRTeD framework integrating temporal causal representation learning with irregular tensor decomposition.
result Framework provides theoretical guarantees and outperforms state-of-the-art techniques.

Proposes a model to handle mobile health data with irregular measurements.

problem Handling heterogeneous, multi-resolution data in mobile health.
method Individualized dynamic latent factor model for irregular multi-resolution time series data.
result Superior performance compared to existing methods in simulation and smartwatch data applications.

TGNN4I model forecasts irregularly observed graph data using ODEs.

problem Forecasting graph-structured data with irregular time steps and partial observations.
method Introduces a time-continuous latent state in each node using ODEs and GRUs, integrating graph neural network layers.
result Validated usefulness of graph structure and time-continuous dynamics in irregular observation settings.

We propose a class of intrinsic Gaussian processes (in-GPs) for interpolation, regression and classification on manifolds with a primary focus on complex constrained domains or irregular shaped spaces arising as subsets or submanifolds of R, R2, R3 and beyond. For example, in-GPs can accommodate spatial domains arising…

2018-01-03abs ↗pdf ↗

A new method uses sinusoidal functions to represent timestamps as dense vectors for improving irregularly sampled time series learning.

problem Challenges in supervised learning with irregularly sampled time series due to irregular time intervals.
method Proposes a novel method to represent timestamps as dense vectors using sinusoidal functions, called Time Embeddings.
result Improves LSTM-based and classical machine learning models, especially with very irregular data.

Paper reviews multi-way graph signal processing for tensor data.

problem Maximizing use of multi-way structure in irregular tensor data.
method Generalizes GSP to multi-way data, focusing on graph signals across tensor modes.
result Synthesizes common themes in combining GSP with tensor analysis.

New BdryMatérn GP model for reliable boundary integration on irregular domains.

problem Incorporating boundary information in Gaussian process models for complex phenomena.
method Proposes a novel BdryMatérn GP framework with a new covariance kernel derived via path integral and stochastic PDE.
result Sample paths from the BdryMatérn GP satisfy desired boundaries with smoothness control on derivatives.

With the developments of the last decade on complete constant mean curvature 1 (CMC 1) surfaces in the hyperbolic 3-space H3H^3, many examples of such surfaces are now known. However, most of the known examples have regular ends. (An end is irregular, resp. regular, if the hyperbolic Gauss map of the surface has an ess…

2008-05-24abs ↗pdf ↗

We show that there are no irregular Sasaki-Einstein structures on rational homology 5-spheres. On the other hand, using K-stability we prove the existence of continuous families of non-toric irregular Sasaki-Einstein structures on odd connected sums of S2×S3S^2 \times S^3.

2018-06-01abs ↗pdf ↗

This review assesses deep-learning methods for complex sequential data.

problem Lack of robustness and transparency in deep-learning frameworks for irregular sequential data.
method Systematic literature review of existing algorithms.
result Recurrent neural networks dominate in performance evaluation of deep-learning frameworks.

Detecting patterns in real time streaming data has been an interesting and challenging data analytics problem. With the proliferation of a variety of sensor devices, real-time analytics of data from the Internet of Things (IoT) to learn regular and irregular patterns has become an important machine learning problem to …

2018-11-16abs ↗pdf ↗

Moon phases added to stock market analysis for better pattern recognition.

problem Finding meaningful patterns in stock market data using irregular time sampling.
method Incorporating Moon phases into the Gregorian calendar time sampling methods for stock market analysis.
result Moon phases provide unique, irregular sampling features for stock market pattern recognition.

LLapDiff models irregular multivariate time series without step-by-step integration.

problem Trade-off between discrete and continuous methods for long-horizon forecasting.
method Generative framework that models target as a low-dimensional latent trajectory, guided by modal parameterization and Laplace domain poles.
result Improves long-horizon forecasting over baselines and supports missing-value imputation.

PSLR classifies functional data with scalar covariates using path signatures.

problem Classical functional logistic regression models have limitations in capturing nonlinear and cross-channel dependencies.
method PSLR uses truncated path signatures to create a basis-free representation of functional data.
result PSLR outperforms traditional functional classifiers in accuracy and robustness, especially under non-uniform sampling.