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.

169,051 papers · 148 categories

Trend · papers per month

21436485 · Jul 202019922001200920182026
48 results for subset scanning

We present a novel subset scan method to detect if a probabilistic binary classifier has statistically significant bias -- over or under predicting the risk -- for some subgroup, and identify the characteristics of this subgroup. This form of model checking and goodness-of-fit test provides a way to interpretably detec…

2016-11-24abs ↗pdf ↗

The pairwise influence matrix of Dobrushin has long been used as an analytical tool to bound the rate of convergence of Gibbs sampling. In this work, we use Dobrushin influence as the basis of a practical tool to certify and efficiently improve the quality of a discrete Gibbs sampler. Our Dobrushin-optimized Gibbs samp…

2017-07-18abs ↗pdf ↗

Simplified feature selection using a single agent with restructured choice strategy.

problem Efficiency and cost issues in multi-agent reinforced feature selection.
method Single-agent approach with restructured choice strategy, including scanning method, feature prioritization, state representation, and reward scheme.
result Improved efficiency and effectiveness of feature selection.

Statistical image reconstruction (SIR) methods are studied extensively for X-ray computed tomography (CT) due to the potential of acquiring CT scans with reduced X-ray dose while maintaining image quality. However, the longer reconstruction time of SIR methods hinders their use in X-ray CT in practice. To accelerate st…

2015-12-14abs ↗pdf ↗

Random scan CAVI converges linearly under log-concave assumptions.

problem Analyzing the convergence rate of random scan Coordinate Ascent Variational Inference (CAVI) under log-concave conditions.
method Building on previous work, we analyze the random scan version of CAVI using optimal transport geometry.
result We obtain tight linear convergence rates for the random scan version of CAVI.

FUNSD dataset tackles noisy scanned forms, offering comprehensive annotations.

problem Extracting and structuring textual content from noisy scanned documents.
method Comprehensive dataset with real, fully annotated forms, including text detection, OCR, layout analysis, and entity linking.
result First publicly available dataset for form understanding, addressing challenges in noisy scanned documents.

We describe two recently proposed machine learning approaches for discovering emerging trends in fatal accidental drug overdoses. The Gaussian Process Subset Scan enables early detection of emerging patterns in spatio-temporal data, accounting for both the non-iid nature of the data and the fact that detecting subtle p…

2017-10-06abs ↗pdf ↗

Paper explores vulnerabilities in image authenticity detection methods, especially printing and scanning attacks.

problem Vulnerability of image authenticity detection models to printing and scanning attacks.
method Demonstrates and proposes a new machine learning model to counter these attacks.
result Proposed model outperforms state-of-the-art models when trained on images from a single printer.

Paper reproduces a kernel-based scan B-statistic for online change-point detection.

problem Continuous detection of distribution changes in online data streams.
method Efficient kernel-based scan B-statistic for online change-point detection.
result Scan B-statistic outperforms parametric methods in challenging scenarios.

Processes such as disease propagation and information diffusion often spread over some latent network structure which must be learned from observation. Given a set of unlabeled training examples representing occurrences of an event type of interest (e.g., a disease outbreak), our goal is to learn a graph structure that…

2017-01-05abs ↗pdf ↗

GAN normalizes CT scans for consistent radiomic feature values.

problem Variations in dose levels and slice thickness affect radiomic features sensitivity.
method Used a 3D generative adversarial network (GAN) to normalize reduced dose, thick slice images to normal dose, thinner slice images.
result GAN-based approach led to significantly smaller error in radiomic features.

SCAN divides deep neural networks into shallow classifiers for efficient deployment.

problem Explosive growth in storage and computation limits deep neural networks on edge devices.
method SCAN divides networks into shallow classifiers, uses attention modules and knowledge distillation, and employs a threshold-controlled scalable inference mechanism.
result SCAN achieves significant performance gain on CIFAR100 and ImageNet without hyper-parameter adjustments.

Framework detects and mitigates data-poisoning attacks in causal effect estimation.

problem Vulnerability to append-only attacks in observational causal analyses.
method Develops a data-poisoning audit for augmented inverse-probability-weighted estimation.
result Proposes a greedy scan to compute exact worst-case movement at every append budget.

BP pretreatment reduces multi-label classification time.

problem Efficiently annotate large label sets for extreme multi-label classification.
method Divide instances into clusters, attach most relevant labels, train on pairs of clusters.
result BP reduces prediction time significantly without sacrificing accuracy.

The seemingly infinite diversity of the natural world arises from a relatively small set of coherent rules, such as the laws of physics or chemistry. We conjecture that these rules give rise to regularities that can be discovered through primarily unsupervised experiences and represented as abstract concepts. If such r…

2017-07-11abs ↗pdf ↗

Automated brain CT image retrieval from traumatic brain injury cohorts using deep neural networks.

problem Manual image retrieval of whole brain CT scans from large clinical cohorts is time-consuming and resource-intensive.
method Proposes a deep convolutional neural network (dMIR) for automated classification of 2D montage images.
result Achieved high accuracy (f1=1.0) for validation and testing data sets.

Radiological imaging of the prostate is becoming more popular among researchers and clinicians in searching for diseases, primarily cancer. Scans might be acquired with different equipment or at different times for prognosis monitoring, with patient movement between scans, resulting in multiple datasets that need to be…

2016-08-02abs ↗pdf ↗

A new knot invariant using tangle-valued 1-cocycles.

problem Creating a strong and calculable knot invariant.
method Constructing a non-trivial combinatorial 1-cocycle L\mathbb{L} that takes values in H0(Θ;Z)H_0(Θ;\mathbb{Z}) with the scan-property.
result The Alexander tree is an isotopy invariant of knots, demonstrating the non-invertibility of specific knots.

Six AI solutions accurately detect growth plate planes in mice bone scans.

problem Manual, time-consuming, and variable bone growth plate detection in micro-CT scans.
method Prepared and annotated a dataset of 3D μCT scans, organized a challenge, and developed six computer vision solutions.
result Achieved mean absolute error of 1.91±0.87 planes from ground truth.

Future grid scenario analysis requires a major departure from conventional power system planning, where only a handful of most critical conditions is typically analyzed. To capture the inter-seasonal variations in renewable generation of a future grid scenario necessitates the use of computationally intensive time-seri…

2016-12-14abs ↗pdf ↗

Optimizes ASL-MRF scan design for precise brain hemodynamics quantification.

problem Fixing model parameters in ASL introduces bias, and multiparametric estimation degrades precision.
method Optimizes ASL labeling durations using Cramer-Rao Lower Bound (CRLB) and proposes a neural network regression framework.
result Improved precision in estimating multiple hemodynamic parameters from a single scan.

Computer science scans LLMs to understand and manipulate their economic forecasts.

problem Understanding and controlling the reasoning of large language models in economics.
method Brain scanning techniques applied to LLMs to identify and manipulate underlying concepts.
result LLMs can be steered to generate forecasts with specific biases, allowing for correction or simulation.

For large scale on-line inference problems the update strategy is critical for performance. We derive an adaptive scan Gibbs sampler that optimizes the update frequency by selecting an optimum mini-batch size. We demonstrate performance of our adaptive batch-size Gibbs sampler by comparing it against the collapsed Gibb…

2018-01-27abs ↗pdf ↗

Investigates polynomial time algorithms for computing Khovanov homology of braids.

problem Computing Khovanov homology for general braids is intractable.
method Examines polynomial time algorithms for 3-braids and a variation of the scanning algorithm for more general braids.
result Shows that for 3-braids, Khovanov homology can be computed in polynomial time, while for more general braids, it can be computed in polynomial time for bounded homological degrees.

A method for MRI brain tumor segmentation using feature vectors and kernel dictionary learning.

problem Segmenting brain tumor regions in MRI images.
method Extracting feature vectors, training kernel dictionaries, and selecting informative feature vectors.
result The method outperforms other methods in segmentation accuracy and reduces training time.

Microdata improves inflation forecasts after major shocks, study finds.

problem Forecasting inflation in a non-stationary environment with microeconomic data.
method Developed a scan test to detect periods of micro forecast outperformance, combined with adaptive machine learning.
result Micro forecasts improve inflation predictions after major shocks, especially after 2020.