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

Trend · papers per month

13274053 · Oct 201919922001200920172026
48 results for spatial contiguity

STICC clusters geographic objects considering both spatial contiguity and attributes.

problem Discovering repeated geographic patterns with spatial contiguity.
method Spatial Toeplitz Inverse Covariance-Based Clustering (STICC) method.
result STICC significantly outperforms baseline methods in adjusted rand index and macro-F1 score.

Scalable method for regionalizing and extracting temporal patterns from time series data.

problem Static spatial snapshots and ad hoc regularization limit effective spatial analysis and resource management.
method Minimum description length principle for fully nonparametric spatial partitioning and time series archetypes.
result Accurately recovers planted regional structure and drivers in synthetic and empirical data.

Identification of regions of interest (ROI) associated with certain disease has a great impact on public health. Imposing sparsity of pixel values and extracting active regions simultaneously greatly complicate the image analysis. We address these challenges by introducing a novel region-selection penalty in the framew…

2016-05-27abs ↗pdf ↗

Spatial machine learning improves poverty targeting in Indonesia.

problem Conventional PMT methods have high exclusion and inclusion errors due to spatial dependencies and regional heterogeneity.
method Integrates spatial contiguity matrices into SML models to identify and compare poverty clusters.
result SML reduces exclusion errors from 28% to 20% compared to standard machine learning models.

In this paper, we propose a Ward-like hierarchical clustering algorithm including spatial/geographical constraints. Two dissimilarity matrices D0D_0 and D1D_1 are inputted, along with a mixing parameter α[0,1]α\in [0,1]. The dissimilarities can be non-Euclidean and the weights of the observations can be non-uniform. The fi…

2017-07-12abs ↗pdf ↗

A new method for faster spatial modeling on exascale computers.

problem Scalable, memory-efficient machine learning for spatially distributed data.
method Partitioned Sparse Variational Gaussian Process (PSVGP) with decentralized communication.
result Improved spatial predictions and better model fit with minimal overhead.

flexBART improves BART for categorical predictors by creating flexible tree partitions.

problem Limitation of BART in handling categorical predictors with one-hot encoding.
method flexBART re-implements BART with regression trees that can assign multiple levels to both branches of a decision tree node, and proposes a new decision rule prior for spatial data.
result flexBART often yields improved predictive performance and scales better to larger datasets than existing BART implementations.

Paper introduces an unsupervised tensor-based anomaly detection method for spatiotemporal data.

problem Challenges in detecting anomalies in spatiotemporal data, especially in urban traffic monitoring and medical imaging.
method Formulates anomaly detection as a regularized robust low-rank + sparse tensor decomposition, incorporating spatiotemporal smoothness and local dependencies.
result Demonstrates improved anomaly detection performance on both synthetic and real data.

Sharp thresholds and contiguity for community detection in contextual SBM.

problem Community detection in graphs with high-dimensional node-covariates.
method Contextual Stochastic Block Model, non-rigorous cavity method, information theory.
result Established the sharp threshold for detection and weak recovery in the contextual SBM.

New algorithms improve uncertainty estimation in satellite precipitation predictions.

problem Lack of uncertainty estimates in machine learning spatial precipitation predictions from satellite data.
method Benchmarked six algorithms including LightGBM, compared using quantile scoring functions and rules.
result LightGBM outperformed other algorithms in quantile scoring rule by 11.10%.

We prove lognormal distribution for symmetric perceptron model, solving key conjectures.

problem Understanding the performance of learning algorithms in neural networks.
method Lognormal distribution characterization and small graph conditioning method.
result Established lognormal distribution and several conjectures for the symmetric perceptron model.

The classic double bubble theorem says that the least-perimeter way to enclose and separate two prescribed volumes in RN\mathbb{R}^N is the standard double bubble. We seek the optimal double bubble in RN\mathbb{R}^N with density, which we assume to be strictly log-convex. For N=1N=1 we show that the solution is sometime…

2017-08-10abs ↗pdf ↗

We consider the problems of detection and localization of a contiguous block of weak activation in a large matrix, from a small number of noisy, possibly adaptive, compressive (linear) measurements. This is closely related to the problem of compressed sensing, where the task is to estimate a sparse vector using a small…

2012-09-15abs ↗pdf ↗

Using ideas from shape theory we embed the coarse category of metric spaces into the category of direct sequences of simplicial complexes with bonding maps being simplicial. Two direct sequences of simplicial complexes are equivalent if one of them can be transformed to the other by contiguous factorizations of bonding…

2009-06-07abs ↗pdf ↗

The paper develops distribution-free methods for ordinal classification.

problem Constructing valid prediction sets for ordinal classification problems.
method Leveraging conformal prediction and multiple testing with FWER control.
result The proposed methods achieve satisfactory levels of marginal and class-specific conditional coverages.

New method explains computational barriers in high-dimensional statistical models.

problem Understanding detection-recovery gaps in high-dimensional inference.
method Combining algorithmic contiguity and cross-validation reduction to obtain conditional computational lower bounds.
result Mild control of low-degree advantage is sufficient to explain computational barriers for recovery.

Paper proves computational hardness for graph matching and detection problems.

problem Computational hardness for graph matching and detection problems in correlated random graphs.
method Algorithmic contiguity and low-degree advantage bounds.
result No efficient algorithms exist for certain graph matching and detection problems.

Complex non-linear interactions between banks and assets we model by two time-dependent Erdős Renyi network models where each node, representing bank, can invest either to a single asset (model I) or multiple assets (model II). We use dynamical network approach to evaluate the collective financial failure---systemic ri…

2014-03-22abs ↗pdf ↗

New insights into bias-variance tradeoff for data-driven optimization under local misspecification.

problem Understanding the relative performance of SAA, IEO, and ETO under local misspecification.
method Developed a local misspecification perspective using contiguity theory in statistics.
result Explicit expressions for decision bias and geometric understanding of variance.

New framework for analyzing hydroclimatic time series across multiple scales.

problem Understanding geophysical processes and evaluating stochastic models across different time scales.
method A novel feature compilation method for multi-scale hydroclimatic analyses.
result Identified similarities and differences in time series types across various temporal resolutions.

In this paper, we work to construct mosaic representations of knots on the torus, rather than in the plane. This consists of a particular choice of the ambient group, as well as different definitions of contiguous and suitably connected. We present conditions under which mosaic numbers might decrease by this projection…

2012-06-18abs ↗pdf ↗

This paper sharpens privacy guarantees for high-dimensional PCA under differential privacy.

problem Understanding the exact privacy loss in high-dimensional PCA with differential privacy.
method Analyzes the exponential mechanism in a model-free setting for high-dimensional PCA.
result Sharp utility and privacy characterizations in high dimensions show the difficulty of detecting a target individual's presence.

This paper proposes new search algorithms for counterfactual explanations based upon mixed integer programming. We are concerned with complex data in which variables may take any value from a contiguous range or an additional set of discrete states. We propose a novel set of constraints that we refer to as a "mixed pol…

2019-01-02abs ↗pdf ↗

Spatial blind source separation simplifies multivariate spatial prediction.

problem Predicting multivariate measurements at unobserved locations with spatial dependencies.
method Spatial blind source separation as a pre-processing tool compared to Cokriging and neural networks.
result Spatial blind source separation simplifies spatial prediction by avoiding cross-dependencies.

Defines non-parabolic curves in spatial hybrid space with applications.

problem Defining and analyzing non-parabolic spatial hybrid framed curves.
method Definition and proof of existence and uniqueness theorem for non-parabolic spatial hybrid framed curves.
result Existence and uniqueness theorem for non-parabolic spatial hybrid framed curves.

A framework converts spatial data into embeddings for insurance risk modelling.

problem Improving underwriting precision and risk management in insurance with spatial data.
method Multi-view contrastive learning framework for generating spatial embeddings.
result Spatial embeddings consistently improve predictive accuracy across various models.

This study analyses, through cross-section estimation methods, the influence of spatial effects in the conditional product convergence in the parishes' economies of mainland Portugal between 1991 and 2001 (the last year with data available for this spatial disaggregation level). To analyse the data, Moran's I statistic…

2011-10-25abs ↗pdf ↗

We compute exact values respectively bounds of "distances" - in the sense of (transforms of) power divergences and relative entropy - between two discrete-time Galton-Watson branching processes with immigration GWI for which the offspring as well as the immigration is arbitrarily Poisson-distributed (leading to arbitra…

2010-05-20abs ↗pdf ↗

In this paper, we prove than given two cubic knots K1K_1, K2K_2 in R3\mathbb{R}^3, they are isotopic if and only if one can pass from one to the other by a finite sequence of cubulated moves. These moves are analogous to the Reidemeister moves for classical tame knots. We use the fact that a cubic knot is determined by…

2013-02-08abs ↗pdf ↗

New method estimates spatial weights matrix for lattice data, improving prediction accuracy.

problem Estimating spatial dependence structure for regular lattice data.
method Adaptive lasso with cross-sectional resampling to estimate sparse spatial weights matrix.
result Improves prediction accuracy of nitrogen dioxide concentrations.

Markov regime switching models have been used in numerous empirical studies in economics and finance. However, the asymptotic distribution of the likelihood ratio test statistic for testing the number of regimes in Markov regime switching models has been an unresolved problem. This paper derives the asymptotic distribu…

2018-01-21abs ↗pdf ↗