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

8162331 · Jun 201919922001200920172026
48 results for greedy scan

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.

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.

We introduce SparseVM, a method that registers clinical-quality 3D MR scans both faster and more accurately than previously possible. Deformable alignment, or registration, of clinical scans is a fundamental task for many clinical neuroscience studies. However, most registration algorithms are designed for high-resolut…

2018-12-17abs ↗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.

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.

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 ↗

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 ↗

We present a new dataset for form understanding in noisy scanned documents (FUNSD) that aims at extracting and structuring the textual content of forms. The dataset comprises 199 real, fully annotated, scanned forms. The documents are noisy and vary widely in appearance, making form understanding (FoUn) a challenging t…

2019-05-27abs ↗pdf ↗

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.

Greedy algorithm achieves sublinear regret for various distributions.

problem Efficient performance of greedy algorithms in linear contextual bandit problems.
method Introduced Local Anti-Concentration (LAC) condition to ensure sublinear regret.
result Greedy algorithm achieves O(polylogT)O(\operatorname{poly} \log T) cumulative expected regret.

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 ↗

This work views neural networks as data generating systems and applies anomalous pattern detection techniques on that data in order to detect when a network is processing an anomalous input. Detecting anomalies is a critical component for multiple machine learning problems including detecting adversarial noise. More br…

2018-10-19abs ↗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.

We present an information-theoretic framework for sequential adaptive compressed sensing, Info-Greedy Sensing, where measurements are chosen to maximize the extracted information conditioned on the previous measurements. We show that the widely used bisection approach is Info-Greedy for a family of kk-sparse signals b…

2014-07-02abs ↗pdf ↗

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.

New distributions allow greedy arm selection in sparse bandit problems.

problem Sparse contextual bandit problem with sparse parameters and feature distributions.
method Introduced new distribution classes and demonstrated that mixtures of these distributions are also greedy-applicable.
result Greedy algorithm applicable to a wider range of arm feature distributions, including those with origin-asymmetric support.

We consider the change-point detection problem of deciding, based on noisy measurements, whether an unknown signal over a given graph is constant or is instead piecewise constant over two connected induced subgraphs of relatively low cut size. We analyze the corresponding generalized likelihood ratio (GLR) statistics a…

2012-06-04abs ↗pdf ↗

This study assesses the reproducibility of 1H-MRS scans across different vendors and sessions.

problem Lack of harmonization in magnetic resonance spectroscopy protocols among vendors.
method Analysis of CV and ICC for within- and between-sessions, and correlation coefficients for across machines.
result Metabolite concentrations are highly reproducible across different vendors and sessions.

This paper is a follow up to the previous author's paper on convex optimization. In that paper we began the process of adjusting greedy-type algorithms from nonlinear approximation for finding sparse solutions of convex optimization problems. We modified there three the most popular in nonlinear approximation in Banach…

2012-06-02abs ↗pdf ↗

Introduces greedy feature selection for classifier-dependent feature ranking.

problem Feature selection for classification tasks.
method Greedy feature selection, identifying the most important feature at each step based on the selected classifier.
result Theoretical and numerical benefits of greedy feature selection.

Gliomas are the most common primary brain malignancies, with different degrees of aggressiveness, variable prognosis and various heterogeneous histologic sub-regions, i.e., peritumoral edematous/invaded tissue, necrotic core, active and non-enhancing core. This intrinsic heterogeneity is also portrayed in their radio-p…

2018-11-05abs ↗pdf ↗

AI tool automates blood segmentation from head CT scans after SAH.

problem Accurate volumetric assessment of SAH patients for clinical and prognostic implications.
method Transformer-based Swin UNETR architecture for noncontrast CT scans.
result High accuracy and robust performance across internal and external validation cohorts.

This paper proposes and evaluates the k-greedy equivalence search algorithm (KES) for learning Bayesian networks (BNs) from complete data. The main characteristic of KES is that it allows a trade-off between greediness and randomness, thus exploring different good local optima. When greediness is set at maximum, KES co…

2012-10-19abs ↗pdf ↗

Kulldorff's (1997) seminal paper on spatial scan statistics (SSS) has led to many methods considering different regions of interest, different statistical models, and different approximations while also having numerous applications in epidemiology, environmental monitoring, and homeland security. SSS provides a way to …

2019-06-13abs ↗pdf ↗