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

24487296 · Jun 202019922001200920172026
48 results for neighbor regions

The paper tackles time series data by applying conformal prediction with nearest neighbors.

problem Time series data violates the exchangeability assumption required for conformal prediction.
method The approach uses the nearest neighbors method with fast parameter tuning and weighted nearest neighbors (FPTO-WNN) to construct reliable prediction intervals.
result Data analysis shows the effectiveness of the proposed approach.

We derive Gaussian approximations for random forest predictions using region-based stabilization.

problem Improving the accuracy of random forest predictions for Poisson process data.
method Region-based stabilization and Malliavin-Stein method for multivariate Gaussian approximation.
result Established Gaussian approximation bounds for random forest predictions under Poisson process.

Nearest neighbor methods are a popular class of nonparametric estimators with several desirable properties, such as adaptivity to different distance scales in different regions of space. Prior work on convergence rates for nearest neighbor classification has not fully reflected these subtle properties. We analyze the b…

2014-06-30abs ↗pdf ↗

A new ensemble method improves kNN performance by extending the neighborhood rule.

problem Traditional kNN's limitations when test points are outside the spherical region and ensemble's high errors.
method Determines neighbors in k steps, using bootstrap samples and optimal models selection.
result The proposed ensemble method outperforms state-of-the-art methods on 17 benchmark datasets.

We consider a generic configuration of regions, consisting of a collection of distinct compact regions {Ωi}\{Ω_i\} in Rn+1\mathbb{R}^{n+1} which may be either smooth regions disjoint from the others or regions which meet on their piecewise smooth boundaries Bi\mathcal{B}_i in a generic way. We introduce a skeletal linking …

2014-02-22abs ↗pdf ↗

This paper presents a new approach for Gaussian process (GP) regression for large datasets. The approach involves partitioning the regression input domain into multiple local regions with a different local GP model fitted in each region. Unlike existing local partitioned GP approaches, we introduce a technique for patc…

2017-01-23abs ↗pdf ↗

The paper develops methods for constructing confidence regions for regression functions in binary classification.

problem Building distribution-free confidence regions for regression functions in binary classification.
method Resampling test and empirical risk minimization approach for model classes with finite pseudo-dimensions and inverse Lipschitz parameterizations.
result Strong uniform consistency and exponential probably approximately correct bounds on the L2L_2 sizes of the regions.

Dynamic Ensemble Selection (DES) techniques aim to select locally competent classifiers for the classification of each new test sample. Most DES techniques estimate the competence of classifiers using a given criterion over the region of competence of the test sample (its the nearest neighbors in the validation set). T…

2018-04-18abs ↗pdf ↗

Graph convolution networks (GCN) have emerged as the leading method to classify node classes in networks, and have reached the highest accuracy in multiple node classification tasks. In the absence of available tagged samples, active learning methods have been developed to obtain the highest accuracy using the minimal …

2019-06-20abs ↗pdf ↗

Neural networks classify OOD images by their nearest neighbor in training data.

problem Understanding out-of-distribution prediction behavior of neural networks.
method Nearest category generalization (NCG) measure to assess OOD prediction accuracy.
result Adversarially robust networks have higher NCG accuracy than natural training, indicating local regularization impacts decision regions.

We introduce a variant of the kk-nearest neighbor classifier in which kk is chosen adaptively for each query, rather than supplied as a parameter. The choice of kk depends on properties of each neighborhood, and therefore may significantly vary between different points. (For example, the algorithm will use larger $k…

2019-05-29abs ↗pdf ↗

In unsupervised outlier ensembles, the absence of ground truth makes the combination of base outlier detectors a challenging task. Specifically, existing parallel outlier ensembles lack a reliable way of selecting competent base detectors, affecting accuracy and stability, during model combination. In this paper, we pr…

2018-12-04abs ↗pdf ↗

Selecting and combining the outlier scores of different base detectors used within outlier ensembles can be quite challenging in the absence of ground truth. In this paper, an unsupervised outlier detector combination framework called DCSO is proposed, demonstrated and assessed for the dynamic selection of most compete…

2019-11-23abs ↗pdf ↗

In this paper, we investigate the geometry of a general class of gradient flows with multiple local maxima. we decompose the underlying space into disjoint regions of attraction and establish the adjacency criterion. The criterion states a necessary and sufficient condition for two regions of attraction of stable equil…

2014-12-21abs ↗pdf ↗

GBOC detects anomalies in time series data using granular-ball vectors.

problem Challenges in modeling normal behavior in dynamic, nonlinear time series data.
method Granular-ball Vector Data Description (GVDD) and Granular-ball One-Class Network (GBOC).
result GBOC improves anomaly detection in time series data.

A fast method for finding counterfactual explanations for decision forests.

problem Finding counterfactual explanations for decision forests efficiently.
method Constrain optimization to data-populated regions, reducing to nearest-neighbor search.
result Very fast and realistic counterfactual explanations for decision forests.

CuBAS selects informative data points based on curvature for better classification.

problem Lack of efficient sampling strategies for maximizing dataset informativeness.
method Information-geometric framework using curvature scores to select labeled data.
result Consistent and statistically significant improvements over random and uncertainty-based sampling.

Paper proposes a method to model health outcomes using varying-coefficients and KNN-based LASSO.

problem Modeling health outcomes like BMI and cholesterol levels with varying age effects.
method Varying-coefficients regional quantile regression via KNN fused LASSO, with ADMM algorithm.
result Efficacy in capturing complex age-dependent associations between health outcomes and risk factors.

Study on predicting graph labels at nodes using local averaging and distance estimation.

problem Predicting graph labels at nodes given observations at other nodes.
method Local averaging and distance estimation methods for graph regression.
result Alternative methods can achieve standard nonparametric rates even when graph neighborhoods are too large or small.

New GP model estimates piecewise continuous functions.

problem Piecewise continuous regression functions in scientific and engineering applications.
method Local Gaussian process model with partitioned local data and joint estimation of boundaries.
result Superior performance over conventional GP models in estimating piecewise regression functions.

We propose a new localized inference algorithm for answering marginalization queries in large graphical models with the correlation decay property. Given a query variable and a large graphical model, we define a much smaller model in a local region around the query variable in the target model so that the marginal dist…

2017-10-28abs ↗pdf ↗

Dissertation tackles zero-shot anomaly detection, focusing on consistent anomalies and proposing CoDeGraph framework.

problem Consistent anomalies bias distance-based zero-shot anomaly detection methods.
method Formalized consistent anomalies, identified similarity scaling and neighbor-burnout phenomena, introduced CoDeGraph framework.
result CoDeGraph effectively suppresses consistent anomalies in zero-shot anomaly detection.

Model predicts COVID-19 spread with better accuracy than existing methods.

problem Limited daily samples in time for data-driven methods.
method Integrated spatiotemporal model combining epidemic differential equations and RNN.
result Model outperforms existing methods in forecasting cases.

LNPE enhances local connections in embeddings using extended neighbor propagation.

problem Improving local connections and interactions in nonlinear dimensionality reduction.
method Inspired by GCN, LNPE extends 1-hop neighbors to n-hop neighbors in LLE.
result LNPE produces more faithful and robust embeddings with better topological and geometrical properties.

Clustering and classification critically rely on distance metrics that provide meaningful comparisons between data points. We present mixed-integer optimization approaches to find optimal distance metrics that generalize the Mahalanobis metric extensively studied in the literature. Additionally, we generalize and impro…

2018-03-28abs ↗pdf ↗

We propose a novel non-parametric adaptive anomaly detection algorithm for high dimensional data based on rank-SVM. Data points are first ranked based on scores derived from nearest neighbor graphs on n-point nominal data. We then train a rank-SVM using this ranked data. A test-point is declared as an anomaly at alpha-…

2014-05-02abs ↗pdf ↗

Paper proposes efficient multivariate spatial Fay-Herriot models using variational autoencoders.

problem Estimating population characteristics in small areas with limited data.
method Integrates multivariate spatial Fay-Herriot model with variational autoencoders to leverage spatial structure efficiently.
result Significant computational efficiency improvements for high-dimensional datasets.

Study nearest-neighbor radii under dependent sampling, finding they remain informative.

problem Analyzing nearest-neighbor radii under dependent sampling.
method Consider strong mixing dependent observations, establish distribution-free almost sure convergence and sharp non-asymptotic moment bounds.
result Nearest-neighbor geometry remains informative under dependence sampling.

Characterizes Lebesgue points using nearest neighbor methods.

problem Consistency of classification algorithms based on nearest neighbors.
method Characterization of Lebesgue points via 1-Nearest Neighbor regression.
result Proves convergence of 1-Nearest Neighbor classification algorithms in metric spaces.

A new ensemble method using random projections for kNN classification.

problem Improving kNN classification accuracy through ensemble methods.
method Random projection of bootstrap samples into lower dimensions, using extended neighbourhood rule for base learners.
result Enhanced classification accuracy compared to traditional kNN and other ensembles.

The paper explains how nearest neighbor methods succeed in prediction.

problem Explaining the success of nearest neighbor methods in prediction.
method The paper covers both theoretical and practical aspects of nearest neighbor methods, including statistical guarantees and practical algorithms.
result The paper provides nonasymptotic statistical guarantees and practical algorithms for nearest neighbor methods.