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

1122 · Oct 202419922001200920172026
11 results for VLMs

VLM judges rank well but score poorly; task difficulty and annotation quality affect interval width.

problem VLMs as judges lack reliability indicators in multimodal evaluations.
method Conformal prediction using score-token log-probabilities.
result Evaluation uncertainty is task-dependent, affecting interval width and reliability.

Martingale Doppelgänger-Eval benchmarks VLMs on candlestick evidence vs. trend extrapolation

problem Auditing whether VLMs use chart evidence or trend extrapolation
method Proving formal limitations and designing controlled mechanisms
result Identifying regression coefficients for evidence vs. trend

Study identifies key parameters and input dimensions making LLMs and VLMs brittle.

problem Vulnerability of large language and vision-language models to perturbations.
method Proposed FI measure based on information geometry to quantify sensitivity.
result Small subset of high FI parameters significantly contribute to brittleness.

PyFi uses adversarial agents to train VLMs on financial image understanding.

problem Training VLMs to understand complex financial questions.
method PyFi-600K dataset and adversarial MCTS mechanism.
result Fine-tuned VLMs improve by 19.52% and 8.06% on financial question accuracy.

VERA-V uses variational inference to discover vulnerabilities in multimodal vision-language models.

problem Existing methods for jailbreaking vision-language models are brittle, limited, and focus on single attacks.
method VERA-V recasts jailbreak discovery as learning a joint posterior distribution over text-image prompts, using variational inference and three complementary strategies.
result VERA-V consistently outperforms state-of-the-art baselines, achieving up to 53.75% higher attack success rate.

The study examines how much data is needed for generative and vision-language models to make reliable predictions.

problem Ensuring reliable predictions with low data for models used in medical decision support.
method Analyzes uniform convergence bounds for VLM-induced classifiers under low-dimensional semantic representations.
result Finite-sample uniform convergence bounds for accuracy and calibration functionals of VLM-induced classifiers.

LangDA improves domain adaptation for semantic segmentation by learning context-aware scene descriptions.

problem Improving domain adaptation for semantic segmentation with dense prediction tasks.
method LangDA learns contextual relationships between objects via VLM-generated scene descriptions and aligns image features with text representation.
result LangDA sets new state-of-the-art across three DASS benchmarks, outperforming existing methods.

HyperINF improves influence function estimation for large models with better accuracy and efficiency.

problem Inaccurate and computationally expensive influence function estimation for large-scale models.
method HyperINF leverages Schulz's iterative algorithm and GFIM for low-rank approximation of Hessian matrix.
result HyperINF achieves superior accuracy and performance compared to existing methods on LoRA-tuned models.

MM-DREX adapts LLM experts for financial trading via dynamic routing.

problem Challenges of non-stationary financial markets and static expert designs.
method MM-DREX uses a VLM-powered dynamic router to allocate expert weights and designs heterogeneous trading experts.
result Significantly outperforms 15 baselines across key metrics.

DoRA improves adaptation efficiency for large models by factoring norms and fusing kernels.

problem High-rank DoRA is computationally expensive and infeasible on common GPUs.
method Factored norms and fused Triton kernels to reduce memory and speed up computation.
result Fused implementation is up to 2.0x faster for inference and 1.9x faster for gradient computation.