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

128256384512 · Jun 202019922001200920172026
48 results for region presentations

Core groups are link invariants defined by arc or region presentations.

problem Defining link invariants using different presentations of arcs and regions.
method Introducing core groups as link invariants defined by presentations involving arcs or regions, and extending these to virtual link diagrams.
result Properties of core groups and their extensions to virtual link diagrams are discussed.

The paper contains a short review of techniques examining regional wealth inequalities based on recently published research work but is also presenting unpublished features. The data pertains to Italy (IT), over the period 2007-2011: the number of cities in regions, the number of inhabitants in cities and in regions, a…

2016-02-17abs ↗pdf ↗

In this paper, a regional knot invariant is constructed. Like the Wirtinger presentation of a knot group, each planar region contributes a generator, and each crossing contributes a relation. The invariant is call a tridle of the link. As in the quandle theory, one can define Alexander quandle and get Alexander polynom…

2017-03-17abs ↗pdf ↗

We present a new active learning algorithm that adaptively partitions the input space into a finite number of regions, and subsequently seeks a distinct predictor for each region, both phases actively requesting labels. We prove theoretical guarantees for both the generalization error and the label complexity of our al…

2020-02-18abs ↗pdf ↗

Conformal Prediction Regions match Imprecise Highest Density Regions under consonance.

problem Matching conformal prediction regions with highest density regions.
method Using consonance and the Imprecise Probability theory of clouds.
result Imprecise Highest Density Regions are equivalent to Conformal Prediction Regions under consonance.

Introduces CCR for constructing confidence regions from conformal predictions.

problem Challenges in constructing confidence regions for model parameters.
method Combines conformal prediction intervals for model outputs to establish confidence regions for parameters under minimal assumptions.
result Valid coverage guarantees for finite sample regime, applicable to various model types.

Image segmentation is the process of partitioning an image into a set of meaningful regions according to some criteria. Hierarchical segmentation has emerged as a major trend in this regard as it favors the emergence of important regions at different scales. On the other hand, many methods allow us to have prior inform…

2018-02-20abs ↗pdf ↗

The study estimates the expressiveness of GCNs with bounds on the number of linear regions.

problem Characterizing the expressiveness of graph convolutional networks (GCNs).
method Estimates the number of linear regions for one-layer and multi-layer GCNs.
result GCNs with multiple layers have exponentially more expressivity per parameter than one-layer GCNs.

We investigate the complexity of deep neural networks (DNN) that represent piecewise linear (PWL) functions. In particular, we study the number of linear regions, i.e. pieces, that a PWL function represented by a DNN can attain, both theoretically and empirically. We present (i) tighter upper and lower bounds for the m…

2017-11-06abs ↗pdf ↗

New method learns dynamic brain communication patterns across regions.

problem Current methods struggle with time-varying brain communications and scalability.
method Adaptive Delay Model (ADM) using Markovian Gaussian Processes.
result Captures dynamic neural communication patterns over time.

PARADE generates provably robust adversarial examples for deep networks.

problem Creating robust adversarial examples for deep neural networks.
method Iterative refinement of adversarial regions using optimization to ensure robustness under various perturbations.
result PARADE finds large, provably robust adversarial regions with high volume under various perturbations.

fMRI semantic category understanding using linguistic encoding models attempt to learn a forward mapping that relates stimuli to the corresponding brain activation. Classical encoding models use linear multi-variate methods to predict the brain activation (all voxels) given the stimulus. However, these methods essentia…

2018-11-26abs ↗pdf ↗

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 ↗

sBayFDNN bridges deep learning and functional data analysis for complex, structured data.

problem Challenges in functional data analysis, especially for complex, continuously structured data.
method Sparse Bayesian functional deep neural network (sBayFDNN) that learns adaptive functional embeddings and interpretable region selection.
result First theoretical guarantees for a Bayesian deep functional model, ensuring reliability and statistical rigor.

The aim of this paper is to present a further contribution to the analysis of absolute convergence (and), associated with the neoclassical theory, and conditional, associated with endogenous growth theory, of the sectoral productivity at regional level. Presenting some empirical evidence of absolute convergence of prod…

2011-10-25abs ↗pdf ↗

This is an expository article, explaining recent work by D. Groisser and myself [GS] on the extent to which the boundary region of moduli space contributes to the ``simple type'' condition of Donaldson theory. The presentation is intended to complement [GS], presenting the essential ideas rather than the analytical det…

1997-12-22abs ↗pdf ↗

New methods improve prediction regions for high-dimensional data.

problem Creating effective prediction regions for high-dimensional data.
method CD-split and HPD-split methods that combine split method and data-driven partition.
result CD-split and HPD-split converge to oracle highest predictive density set and satisfy local and asymptotic conditional validity.

Estimates the upper bound of linear regions in spheres centered at specific data points in ReLU neural networks.

problem Bounding the number of linear regions in specific areas of neural networks using ReLU activations.
method Developed a method to estimate the upper bound of linear regions in any sphere within the input space of a ReLU neural network.
result The boundaries of linear regions move away from training data points during training, and spheres centered at these points contain more regions than arbitrary points.

This paper presents a methodology for image classification using Graph Neural Network (GNN) models. We transform the input images into region adjacency graphs (RAGs), in which regions are superpixels and edges connect neighboring superpixels. Our experiments suggest that Graph Attention Networks (GATs), which combine g…

2020-02-13abs ↗pdf ↗

We establish some a priori geometric relations on stable minimal surfaces lying inside three-manifolds with scalar curvature uniformly bounded below. The relations are based on a slight generalization of a formula due to Castillon. We apply it to prove non-local rigidity results in the particular sense that they expres…

2010-02-17abs ↗pdf ↗

Waldo method constructs valid confidence regions for simulator-based inference.

problem Constructing valid confidence regions for simulator-based inference with high-dimensional data.
method Reframes Wald test statistic and uses regression-based machinery for Neyman inversion.
result Waldo method produces conditionally valid and precise confidence regions.

Method uses aggregate crop statistics to improve satellite-based crop type mapping.

problem Limited field-level crop labels for training satellite-based maps.
method Corrects classifier by accounting for shifts in crop type composition and feature means.
result Substantial improvements in overall classification accuracy, reducing misclassifications by 21.9% on average.

A new method selects regions of interest in GC-MS data without prior target selection.

problem Challenges in GC-MS data analysis due to fragmentation and shared fragment ions.
method Uses a pseudo F-ratio moving window (ψψFRMV) to automatically select regions of interest.
result Algorithm can accurately identify signal regions in GC-MS data.

The paper introduces a method for fitting complex models using simulation and optimization.

problem Fitting models with intractable likelihood or moments.
method Sequential sampling and local smoothing, combining global and local search phases.
result The proposed method outperforms alternative approaches in fitting complex models.