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

131262392523 · May 202619922001200920172026
48 results for patch framework

Reinforcement Patching optimizes dynamic sequence patching for efficient time series forecasting.

problem Efficiently learning data-adaptive representations for long-horizon sequence data, especially continuous sequences.
method Reinforcement Patching (ReinPatch) uses reinforcement learning to optimize dynamic patching policies and sequence backbones.
result ReinPatch achieves compelling performance in time-series forecasting compared to state-of-the-art methods.

PatchGuard defends against localized adversarial patches with provable robustness.

problem Localized adversarial patches induce misclassification in machine learning models.
method PatchGuard uses CNNs with small receptive fields and robust masking to detect and mask corrupted features.
result PatchGuard achieves state-of-the-art provable robust accuracy and clean accuracy.

Model patching closes subgroup performance gaps in skin cancer classification.

problem Inconsistent model performance on specific subgroups of a class.
method Two-stage framework that models subgroup features and learns semantic transformations, followed by data augmentation.
result Reductions in robust error of up to 33% relative to best baseline on benchmark datasets.

Many signal processing algorithms break the target signal into overlapping segments (also called windows, or patches), process them separately, and then stitch them back into place to produce a unified output. At the overlaps, the final value of those samples that are estimated more than once needs to be decided in som…

2018-08-20abs ↗pdf ↗

We give the first provably efficient algorithm for learning a one hidden layer convolutional network with respect to a general class of (potentially overlapping) patches. Additionally, our algorithm requires only mild conditions on the underlying distribution. We prove that our framework captures commonly used schemes …

2018-02-07abs ↗pdf ↗

Enhances financial time series forecasting with a multi-period learning framework.

problem Accurate financial time series forecasting requires considering both short-term and long-term trends.
method Proposes a Multi-period Learning Framework (MLF) with three modules: Inter-period Redundancy Filtering, Learnable Weighted-average Integration, and Multi-period self-Adaptive Patching.
result Improves financial time series forecasting accuracy and efficiency.

Proposes a new approach to time series representation learning by embedding patches independently.

problem Capturing dependencies between time series patches is not optimal for representation learning.
method 1) Patch reconstruction task, 2) Patch-wise MLP, 3) Complementary contrastive learning.
result Improves time series forecasting and classification performance compared to state-of-the-art models.

Recently, it was demonstrated in [CS2012,CS2013] that the robustness of the classical Non-Local Means (NLM) algorithm [BCM2005] can be improved by incorporating p(0<p2)\ell^p (0 < p \leq 2) regression into the NLM framework. This general optimization framework, called Non-Local Patch Regression (NLPR), contains NLM as a spe…

2013-03-02abs ↗pdf ↗

PACE explains ViTs by modeling patch-level concept distributions, surpassing existing methods.

problem Lack of trustworthy post-hoc explanations for Vision Transformers (ViTs)
method Variational Bayesian explanation framework (PACE)
result PACE surpasses state-of-the-art methods in meeting desiderata for ViT explanations.

Sparse connectivity improves generalization in neural networks below the Edge of Stability.

problem Generalization guarantees for fully-connected networks fail at the Edge of Stability.
method Analyzed sparse connectivity's impact on generalization in two-layer ReLU networks.
result Sparse connectivity changes the effective constraint, leading to non-vacuous generalization bounds.

AaSP improves audio self-supervised learning by addressing aliasing issues.

problem Alias issues in audio spectrogram transformers.
method AaSP combines aliasing-aware patch representation, teacher-student masked modeling, cross-attention predictor, and contrastive regularization.
result AaSP learns more stable representations that integrate high-frequency cues.

New method makes neural networks more resilient to location-optimized adversarial patches.

problem Neural networks' vulnerability to adversarial patches that are visible but still effective.
method Developed a practical approach to optimize patch locations and applied adversarial training.
result Significantly improved robustness against adversarial patches on CIFAR10 and GTSRB.

Data is said to follow the transform (or analysis) sparsity model if it becomes sparse when acted on by a linear operator called a sparsifying transform. Several algorithms have been designed to learn such a transform directly from data, and data-adaptive sparsifying transforms have demonstrated excellent performance i…

2018-03-06abs ↗pdf ↗

Analytic patch trees reveal new geometric structures and dimension fields.

problem Understanding the geometric and analytical properties of surface patch trees.
method Developed analytic surface patch trees and introduced interface curves to transmit state.
result Surface patch trees have natural foliations with one-dimensional curve trees and dimension fields.

MAT combines meta-learning and adversarial training to defend against universal patches.

problem Defending against universal patches that fool models in various contexts.
method Meta adversarial training (MAT) integrates meta-learning with adversarial training.
result MAT increases robustness against universal patch attacks on image classification and traffic-light detection.

Patch priors have become an important component of image restoration. A powerful approach in this category of restoration algorithms is the popular Expected Patch Log-Likelihood (EPLL) algorithm. EPLL uses a Gaussian mixture model (GMM) prior learned on clean image patches as a way to regularize degraded patches. In th…

2018-02-05abs ↗pdf ↗

BagCert efficiently certifies robustness against adversarial patches on image classifiers.

problem Adversarial patches pose a threat to autonomous systems' perception component.
method BagCert combines model architecture and certification procedure for efficient inference.
result BagCert certifies 10,000 examples in 43 seconds on a single GPU, achieving 86% clean and 60% certified accuracy against 5x5 patches.

In this paper we address the problem of understanding the success of algorithms that organize patches according to graph-based metrics. Algorithms that analyze patches extracted from images or time series have led to state-of-the art techniques for classification, denoising, and the study of nonlinear dynamics. The mai…

2011-07-02abs ↗pdf ↗

The main ob jective of this research is to find the different types of elliptic triangulations for planar discs and spheres. We begin in Chapter 1 with the mandatory introduction. In the second chapter we define and study the notion of a patch, that is, a triangulation of a planar disc. By introducing a suitable notion…

2006-08-03abs ↗pdf ↗

Ano-SuPs detects anomalies in images of manufactured products by identifying suspected patches.

problem Challenges in detecting anomalies in image-based manufacturing systems, including complexity of background and various anomaly patterns.
method Two-stage strategy anomaly detection method: first, remove suspected patches; second, refine anomaly identification using normal patches.
result Demonstrated effectiveness through simulation and case studies, identifying key parameters and steps impacting model performance and efficiency.

Convolutional operator learning is gaining attention in many signal processing and computer vision applications. Learning kernels has mostly relied on so-called patch-domain approaches that extract and store many overlapping patches across training signals. Due to memory demands, patch-domain methods have limitations w…

2018-02-15abs ↗pdf ↗

In this paper, we demonstrate a physical adversarial patch attack against object detectors, notably the YOLOv3 detector. Unlike previous work on physical object detection attacks, which required the patch to overlap with the objects being misclassified or avoiding detection, we show that a properly designed patch can s…

2019-06-20abs ↗pdf ↗

There have been different strategies to improve the performance of a machine learning model, e.g., increasing the depth, width, and/or nonlinearity of the model, and using ensemble learning to aggregate multiple base/weak learners in parallel or in series. This paper proposes a novel strategy called patch learning (PL)…

2019-06-01abs ↗pdf ↗

The paper addresses rigid alignment of noisy patches, providing a polynomial time algorithm and convergence conditions.

problem Finding a rigid alignment of overlapping local views (patches) that minimizes alignment error in a noisy setting.
method Characterizes non-degeneracy based on kernel and positivity of a matrix, provides polynomial time algorithm for testing non-degeneracy, and uses Riemannian gradient descent for alignment.
result The algorithm converges locally linearly to a non-degenerate perfect alignment under certain conditions.

GOTEX synthesizes textures by optimizing feature distributions using optimal transport.

problem Texture synthesis with control over feature distributions.
method Optimal transport for statistical feature distribution comparison, semi-dual formulation, minimax optimization.
result GOTEX produces high-quality textures with various features, outperforming state-of-the-art methods.

New projection operators for multipatch spaces with stable properties.

problem Problems with non-matching interfaces in multipatch spaces.
method Construction of commuting projection operators on de Rham sequences of multipatch spaces with local tensor-product parametrization.
result Local and stable projection operators in any LpL^p norm for shape-regular spline patches with different mappings and local refinements.

Researchers construct explicit bundles for ALF metrics, revealing rational patching matrices for gravitational instantons.

problem Constructing explicit toric Ricci-flat metrics and their associated bundles.
method Explicit construction of patching matrices for ALF metrics and gravitational instantons.
result Rational form of patching matrices for gravitational instantons in the Chen--Teo family.

Chronic obstructive pulmonary disease (COPD) is a lung disease where early detection benefits the survival rate. COPD can be quantified by classifying patches of computed tomography images, and combining patch labels into an overall diagnosis for the image. As labeled patches are often not available, image labels are p…

2017-03-15abs ↗pdf ↗

Improved CNN model accuracy and generalizability through data pre-processing.

problem Enhancing accuracy and generalizability of CNN-based LULC classification.
method Trials of different data preparation methods, including patch selection, size, and augmentations.
result Combining multiple grids and rotations of patches improved model accuracy and generalizability.

SaliencyMix augments images with salient patches to improve model generalization.

problem Improving deep learning model generalization through better data augmentation.
method Carefully selects salient patches from images and mixes them with the target image.
result Achieves state-of-the-art top-1 error rates and robustness against adversarial attacks.

PatchGT uses non-trainable graph patches to improve graph representation learning.

problem Learning high-level information in graph tasks with direct Transformer models.
method PatchGT segments graphs into non-trainable patches, uses GNN for patch-level learning, and Transformer for graph-level learning.
result PatchGT achieves higher expressiveness and competitive performance on benchmark datasets.

We introduce an algorithm for the segmentation of a class of regime switching processes. The segmentation algorithm is a non parametric statistical method able to identify the regimes (patches) of the time series. The process is composed of consecutive patches of variable length, each patch being described by a station…

2010-01-14abs ↗pdf ↗

New image restoration method using localized patches and external databases.

problem Image restoration challenges.
method Localized structured prediction and non-linear multi-task learning for optimizing a penalized energy function.
result Strong statistical guarantees and practical effectiveness demonstrated on various image restoration problems.