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

0111 · Oct 201319922001200920172026
29 results for subregions

RAMs improve GAMs' accuracy by fitting components to subregions of feature space.

problem Subpar accuracy in GAMs due to inability to capture feature interactions.
method Identify subregions of feature space where interactions are minimized, fitting one component per subregion.
result RAMs offer improved expressiveness compared to GAMs while maintaining interpretability.

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.

Paper develops a novel approach to identify clusters of features in multivariate extremes.

problem Understanding the complex structure of multivariate extremes in various fields.
method Optimization-based approach to assess the dependence structure of extremes.
result Estimating clusters of features that best capture the support of extremes.

BOinG optimizes HPO problems by focusing on promising local regions.

problem Expensive black-box optimization problems, especially hyperparameter optimization.
method Two-stage approach: global surrogate model followed by local model.
result BOinG exploits the structure of typical HPO problems and performs well on mid-sized problems.

A new model predicts spatio-temporal data using adaptive decision trees and point processes.

problem Predicting spatio-temporal data with real-life applications.
method Hawkes process, adaptive decision tree, joint optimization algorithm.
result Significant improvement in predictions compared to standard methods.

ConvNets improve nonstationary covariance estimation for large-scale spatial data.

problem Estimating nonstationary spatial covariance functions on large scales.
method Convolutional Neural Networks (ConvNets) for subregion identification and selection.
result Enhanced accuracy in parameter estimation using ConvNet-based partitioning.

Green-hyperbolic operators are linear differential operators acting on sections of a vector bundle over a Lorentzian manifold which possess advanced and retarded Green's operators. The most prominent examples are wave operators and Dirac-type operators. This paper is devoted to a systematic study of this class of diffe…

2013-10-02abs ↗pdf ↗

Unified method for discovering biclusters and triclusters in longitudinal data.

problem High-dimensional, sparsely sampled, irregularly observed longitudinal data.
method Tri-SfSVD, a unified sparse functional Singular Value Decomposition framework.
result Identified localized structures at the subject, subject-feature, and subject-feature-time levels.

Ensembles are popular methods for solving practical supervised learning problems. They reduce the risk of having underperforming models in production-grade software. Although critical, methods for learning heterogeneous regression ensembles have not been proposed at large scale, whereas in classical ML literature, stac…

2018-04-17abs ↗pdf ↗

We consider smooth complete solutions to Ricci flow with bounded curvature on manifolds without boundary in dimension three. Assuming an open ball at time zero of radius one has curvature bounded from below by -1, then we prove estimates which show that compactly contained subregions of this ball will be smoothed out b…

2014-07-04abs ↗pdf ↗

A natural question in mathematical general relativity is how the ADM mass behaves as a functional on the space of asymptotically flat 3-manifolds of nonnegative scalar curvature. In previous results, lower semicontinuity has been established by the first-named author for pointed C2C^2 convergence, and more generally by…

2019-03-03abs ↗pdf ↗

Single-head attention approximates any function under various norms.

problem Universal approximation of functions using attention mechanisms.
method Interpreting attention as partitioning and summing linear transformations.
result Single-head attention can approximate any continuous function under LL_\infty-norm and Lebesgue integrable functions under LpL_p-norm.

Tensor networks reveal limitations for efficient text description but suggest potential for images.

problem Efficiently describing large text and image data sets using tensor networks.
method Investigation of mutual information scaling, introduction of mutual information estimators, and use of autoregressive and convolutional neural networks.
result Text data cannot be efficiently described by 1D tensor networks, while images may be better described by 2D tensor networks.

Continuous word representation (aka word embedding) is a basic building block in many neural network-based models used in natural language processing tasks. Although it is widely accepted that words with similar semantics should be close to each other in the embedding space, we find that word embeddings learned in seve…

2018-09-18abs ↗pdf ↗

This work shows how to efficiently simulate parts of quantum landscapes using classical computers.

problem Identifying where quantum computers are advantageous and offloading computations.
method Developed a quantum-enhanced classical algorithm to simulate sub-regions of quantum landscapes.
result It is possible to generate a classical surrogate of a sub-region of a quantum landscape.

This paper presents a new probabilistic generative model for image segmentation, i.e. the task of partitioning an image into homogeneous regions. Our model is grounded on a mid-level image representation, called a region tree, in which regions are recursively split into subregions until superpixels are reached. Given t…

2015-06-11abs ↗pdf ↗

New methods improve neural connectivity analysis at submillisecond timescales.

problem Limitations of standard spike train analysis methods in terms of temporal resolution and scalability.
method Developed Monte Carlo and polynomial approximation methods for continuous-time neural spike train analysis.
result Superior accuracy and scalability compared to traditional binned GLMs, enabling precise connectivity inference.

This work addresses local fairness in machine learning models.

problem Ensuring fairness within subregions of feature space, not just global averages.
method Introduces ROAD, a Distributionally Robust Optimization (DRO) approach with adversarial learning.
result Achieves Pareto dominance in local fairness and accuracy across datasets.

New algorithm predicts spatio-temporal events with improved accuracy.

problem Non-stationary spatio-temporal prediction on dense and sparse sequences.
method Probabilistic approach using point processes and self-organizing decision trees.
result Significant performance improvements over baseline and state-of-the-art methods.

Cut-DeepONet handles discontinuities and sharp transitions in neural operators.

problem Neural operators struggle with discontinuities and sharp transitions in PDEs.
method Two-stage training framework that explicitly models discontinuities via a lifting strategy and input-dependent discontinuity prediction.
result Cut-DeepONet outperforms state-of-the-art methods on benchmark PDEs with low-resolution datasets.

The paper refutes the manifold hypothesis for image data and proposes the union of manifolds hypothesis.

problem The manifold hypothesis fails to capture the structure of image data.
method Empirical verification of the union of manifolds hypothesis on image datasets.
result Image data lies on a disconnected set with varying intrinsic dimensions.

Generative model downgrades coarse satellite images to fine resolution.

problem Reconstructing fine resolution satellite images from coarse scale inputs.
method Combines U-Net transfer encoder with diffusion-based generative model.
result Excellent performance (R2 = 0.65 to 0.94) across seasonal regional splits.

Model estimates lung well-aerated volume from CT images, independent of patient and imaging parameters.

problem Lack of clear connection between quantitative metrics in lung CT images and physiology.
method Patient-independent model using Gaussian fit to lower CT histogram data points.
result Model estimates well-aerated volume (WAVE) independent of CT reconstruction parameters and respiratory cycle.