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,657 papers · 148 categories

Trend · papers per month

5101419 · May 202619922001200920172026
48 results for blind spots

Agents trained in simulation may make errors in the real world due to mismatches between training and execution environments. These mistakes can be dangerous and difficult to discover because the agent cannot predict them a priori. We propose using oracle feedback to learn a predictive model of these blind spots to red…

2018-05-23abs ↗pdf ↗

CNNs can develop blind spots due to uneven padding in feature maps.

problem Spatial bias in convolutional networks leads to blind spots in certain tasks.
method Identified and analyzed the role of padding in convolutional networks, proposing solutions to mitigate bias.
result Mitigating spatial bias improves model accuracy, especially in tasks like small object detection.

The adversarial training procedure proposed by Madry et al. (2018) is one of the most effective methods to defend against adversarial examples in deep neural networks (DNNs). In our paper, we shed some lights on the practicality and the hardness of adversarial training by showing that the effectiveness (robustness on t…

2019-01-15abs ↗pdf ↗

A framework to quantify deployment risk in ML systems, especially for rare states.

problem Under-supported rare states in ML models lead to unreliable performance in unseen data.
method Blind-Spot Mass (B_n(tau)) using Good-Turing unseen-species estimation.
result Identifies and quantifies the risk of under-supported states in ML models.

The study reveals flaws in pruning criteria and proposes a new assumption for better filter selection.

problem Flaws in existing pruning criteria for CNNs.
method Empirical experiments and Convolutional Weight Distribution Assumption.
result The Convolutional Weight Distribution Assumption improves filter selection in pruning.

Decoding strategies often exclude human-like tokens, creating a detectable gap in generated text.

problem Decoding strategies exclude contextually appropriate but statistically rare tokens, creating a detectable gap in generated text.
method Analysis of 1.8 million texts across 8 language models, 5 decoding strategies, and 53 hyperparameter configurations.
result 8-18% of human-selected tokens fall outside typical truncation boundaries, indicating a detectable gap.

Theoretical model for iterative user discovery in recommender systems.

problem Iterative feedback loops in recommender systems and their biases.
method Theoretical framework to model system evolution and convergence properties.
result Theoretical bounds and convergence properties on user discovery and blind spots.

Christoffel function characterizes the corruption a bounded-degree certificate cannot remove in robust halfspace learning.

problem Robust halfspace learning under malicious noise
method Sum-of-Squares degree of outlier-removal certificate
result Christoffel function bounds the corruption a bounded-degree certificate cannot remove

We describe a novel method for training high-quality image denoising models based on unorganized collections of corrupted images. The training does not need access to clean reference images, or explicit pairs of corrupted images, and can thus be applied in situations where such data is unacceptably expensive or impossi…

2019-01-29abs ↗pdf ↗

LemonadeBench evaluates LLMs' economic intuition through a simulated lemonade stand.

problem Evaluating LLMs' economic understanding and decision-making in simple markets.
method Simulated lemonade stand business to test LLMs' long-term planning and profit maximization.
result Models achieve profitability but exhibit local rather than global optimization.

New kernel models multi-output Gaussian processes accurately.

problem Challenges in modelling cross-covariances for multiple-output Gaussian processes.
method Replaced Gaussian components with block components of finite bandwidth in spectral mixture kernel.
result First multi-output generalization of spectral mixture kernel that can approximate any stationary multi-output kernel to arbitrary precision.

New method solves blind inverse problems by optimizing both operator and image parameters.

problem Solving blind inverse problems with known forward operator.
method Parallel reverse diffusion guided by gradients from intermediate stages.
result State-of-the-art performance on blind deblurring and imaging through turbulence.

New risk measures for incomplete markets without lattice structures.

problem Risk measures on incomplete markets without lattice structures.
method Study of risk measures without lattice structures, focusing on tractable dual representations and solid superspaces.
result Existence of a tractable dual representation equivalent to a Fatou-like property, and extension theorems under certain conditions.

Explores security challenges of machine learning in real-world systems.

problem Vulnerabilities in machine learning models deployed in safety-critical systems.
method Broadens systems security view of ML vulnerabilities, identifies novel challenges, proposes mitigation suggestions.
result Highlights novel challenges and proposes mitigation strategies for securing ML systems.

Paper addresses the disparity between sampled and mean representations in disentangled learning.

problem Disparity between sampled and mean representations in disentangled learning.
method Proposes a method to eliminate the disparity by proving and utilizing the relationship between total correlation of sampled and mean representations for multivariate normal distributions.
result Demonstrates that a factorized mean representation can have lower total correlation than the sampled representation.

We propose orthogonality as a necessary condition for disentangling aleatoric and epistemic uncertainty.

problem Jointly estimating aleatoric and epistemic uncertainty is problematic and non-trivial.
method We propose orthogonality as a necessary condition for disentanglement and construct UDE to measure orthogonality and consistency.
result Orthogonality and consistency are necessary and sufficient criteria for disentanglement.

Paper develops new spot regression estimators using candlesticks for asset pricing.

problem Estimation of spot betas in asset pricing and risk management.
method Develops a new estimation and inference framework for spot regressions using high-frequency candlesticks.
result The proposed candlestick-based estimators reduce estimation risk and achieve higher power in hypothesis testing.

Spatial blind source separation simplifies multivariate spatial prediction.

problem Predicting multivariate measurements at unobserved locations with spatial dependencies.
method Spatial blind source separation as a pre-processing tool compared to Cokriging and neural networks.
result Spatial blind source separation simplifies spatial prediction by avoiding cross-dependencies.

We propose a solution to the image deconvolution problem where the convolution kernel or point spread function (PSF) is assumed to be only partially known. Small perturbations generated from the model are exploited to produce a few principal components explaining the PSF uncertainty in a high dimensional space. Unlike …

2012-03-21abs ↗pdf ↗

New insights into learning for blind inverse problems with theoretical guarantees.

problem Learning in blind inverse problems where both signal and operator are unknown.
method Data-driven approaches using Linear Minimum Mean Square Estimators (LMMSEs) with theoretical analysis.
result Established equivalences with Tikhonov-regularized formulations and derived finite-sample error bounds.

VERAFI improves financial AI by verifying calculations and compliance.

problem Financial AI systems generate errors and violations during reasoning.
method VERAFI combines dense retrieval, reranking, and automated reasoning policies.
result VERAFI achieves 94.7% factual correctness, 81% relative improvement.

DiffDenoise preserves fine structures in medical images using conditional diffusion models.

problem Medical image denoising often results in loss of fine structures.
method Conditional diffusion model with stabilized reverse sampling and supervised training.
result DiffDenoise outperforms state-of-the-art methods in medical image denoising.

We revisit the Blind Deconvolution problem with a focus on understanding its robustness and convergence properties. Provable robustness to noise and other perturbations is receiving recent interest in vision, from obtaining immunity to adversarial attacks to assessing and describing failure modes of algorithms in missi…

2018-03-21abs ↗pdf ↗

Deep convolutional network has been the state-of-the-art approach for a wide variety of tasks over the last few years. Its successes have, in many cases, turned it into the default model in quite a few domains. In this work, we will demonstrate that convolutional networks have limitations that may, in some cases, hinde…

2018-02-14abs ↗pdf ↗

The study proves constant-curvature analogues of hot spots conjecture for triangles.

problem Proving the hot spots conjecture in constant curvature domains.
method Analyzing geodesic triangles of constant negative curvature and using Killing fields.
result First mixed Dirichlet-Neumann Laplace eigenfunctions have no non-vertex critical points in constant curvature triangles.

New method uses single quantum state for machine learning tasks, improving accuracy.

problem Challenges in unsupervised learning with quantum data.
method SIngle-Preparation Quantum Information Processing (SIPQIP) concept.
result Significantly more accurate estimation compared to traditional methods.

SpotV2Net forecasts intraday spot volatilities using graph attention networks.

problem Forecasting multivariate intraday spot volatilities accurately.
method Graph Attention Network architecture with Fourier estimates of spot and vol-of-vol volatilities.
result SpotV2Net outperforms other models in forecasting accuracy.

New method prevents RLHF alignment collapse by accounting for policy's influence on reward model updates.

problem Iterative RLHF leads to alignment collapse where policies exploit RM's blind spots.
method Foresighted policy optimization (FPO) restores missing steering term via regularization.
result FPO prevents alignment collapse on LLM alignment pipelines using Llama-3.2-1B.