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

Trend · papers per month

3979118157 · Jun 202019922001200920182026
48 results for AI tuning

Transforms web content for better visibility in AI-driven search engines.

problem Disruption of traditional SEO by generative AI search engines.
method Fine-tunes a BART-base transformer on synthetically generated training data.
result Significant improvements in ROUGE-L and BLEU scores, and substantial visibility gains in generative search responses.

Foundation AI model outperforms traditional VaR methods in forecasting.

problem Forecasting Value-at-Risk (VaR) for financial returns.
method Time-series foundation AI model, pre-trained on diverse datasets, fine-tuned for specific quantiles.
result Fine-tuned foundation model consistently outperforms traditional methods in actual-over-expected ratios.

Neural networks with learned biases can approximate any function.

problem Whether neural networks with only learned biases can approximate any continuous function.
method Theoretical and numerical analysis of random weights and learned biases in neural networks.
result Feedforward and recurrent neural networks with random weights can approximate any continuous function and dynamical systems.

Improved AI patent classifier measures U.S. and China's AI patenting.

problem Measuring AI patents with high precision and generalization.
method Fine-tuning PatentSBERTa on manually labeled data from USPTO's AI Patent Dataset.
result Rapid growth in AI patenting in both countries, but different organizational patterns.

QCircuitBench provides a dataset for evaluating AI's ability to design quantum algorithms.

problem Lack of datasets for evaluating AI's capability in designing quantum algorithms.
method Developed a comprehensive benchmark dataset with 120,290 data points, including 25 algorithms and 3 task suites.
result LLMs exhibit consistent error patterns and fine-tuning does not always outperform few-shot learning.

DataInf efficiently approximates data influence in large models, improving transparency and identifying mislabeled data.

problem Efficiently estimating data influence in large-scale models like LoRA-tuned LLMs and diffusion models.
method DataInf uses a closed-form expression to approximate influence scores efficiently.
result DataInf outperforms existing methods in computational and memory efficiency, accurately identifying influential data points.

FinRobot opens-source AI for financial tasks, breaking down complex problems.

problem Barriers to AI adoption in finance due to proprietary data and specialized knowledge.
method Develops open-source AI agent platform with four layers: Financial AI Agents, LLM Algorithms, LLMOps/DataOps, and Foundation Models.
result FinRobot democratizes AI access for financial analysis.

Predicts vessel destinations using AIS data and nearest neighbor search.

problem Accurately predict the destination ports and arrival times of vessel trips.
method Partitioned training routes by destination port, use nearest neighbor search, and incorporate improvements like avoiding frequent port changes and automating parameter tuning.
result Significant improvements in prediction accuracy compared to baseline methods.

FinSphere improves stock analysis quality with AI and expert-curated data.

problem Lack of objective evaluation metrics and depth in stock analysis by FinLLMs.
method Developed AnalyScore, curated Stocksis dataset, and FinSphere AI agent.
result FinSphere outperforms general and domain-specific LLMs in generating high-quality stock analysis reports.

FinAI-BERT classifies AI disclosures in financial reports with high accuracy.

problem Systematic detection of AI-related disclosures in financial reports.
method Fine-tuned transformer-based model on a curated dataset.
result Achieved near-perfect classification performance (99.37% accuracy).

Paper tackles AI driving competition challenges with mixed simulation and real-world data.

problem AI algorithms perform poorly in real-world environments compared to simulated ones and vice versa.
method Employed imitation learning on a mixed dataset to train algorithms equally well in all environments.
result Trained algorithms performed well in both simulated and real-world environments.

Quant 4.0 uses AI to automate, explain, and incorporate knowledge in investment.

problem Limitations of deep learning in quant investment.
method Automated AI, Explainable AI, Knowledge-driven AI.
result Improves investment decision-making through automation, interpretability, and prior knowledge integration.

AI learns to optimize dog-fighting performance using Bayesian optimization.

problem Optimizing AI decision-making in dynamic, volatile combat environments.
method Developed Gaussian process Bayesian optimization (GPBO) techniques with RS and HRMS to improve surrogate model accuracy.
result HRMS improves surrogate model accuracy, allowing AI to more accurately predict and optimize performance.

The paper studies how to allocate human validation in AI-assisted tasks to minimize errors.

problem Heterogeneous reliability of AI-generated signals across tasks, products, and customer segments.
method Tuned prediction-powered inference, upper confidence bounds policy, Neyman square-root rule.
result The proposed policy outperforms uniform and epsilon-greedy allocation, closing most of the gap to the oracle when reliability is heterogeneous.

Unified Bayesian-AI framework improves epidemiological risk prediction and uncertainty quantification.

problem Lack of calibrated uncertainty in machine learning models for epidemiology.
method Combines Bayesian prediction with Bayesian hyperparameter optimization using logistic regression and Gaussian-process Bayesian optimization.
result Unified Bayesian-AI framework provides reliable coverage and improved calibration, enhancing epidemiological decision making.

New framework analyzes LLM personalization trade-offs under congestion.

problem Tension between personalization and resource sharing in LLMs.
method Developed a statistical-economic framework to model user incentives.
result Congestion can flip rankings of SFT and ICL, and offers both methods never hurt profits.

New AI-block models for clustering high-dimensional variables based on maxima of random processes.

problem Clustering high-dimensional variables with weakly dependent maxima of random processes.
method Asymptotic Independent block (AI-block) models and an algorithm for variable clustering.
result The proposed AI-block models and algorithm can effectively identify clusters in high-dimensional data.

Interprets AI model for identifying boosted H → b̄b jets.

problem Difficulty in explaining AI model decisions due to complexity.
method Exploring Interaction Network (IN) model and Neural Activation Pattern (NAP) diagrams.
result NAP diagrams reveal important information about hidden layers' activity.

U-Cast simplifies AI weather forecasting with a standard U-Net and efficient training.

problem Complex AI models limit accessibility and cost for weather forecasting.
method Simple U-Net backbone, deterministic pre-training, and probabilistic fine-tuning with Monte Carlo Dropout.
result U-Cast matches or exceeds state-of-the-art models in accuracy while reducing training and inference costs.

FinDPO uses preference optimization to improve financial sentiment analysis models.

problem Financial sentiment analysis models often fail to generalize to unseen data.
method FinDPO uses Direct Preference Optimization (DPO) to align LLMs with human preferences.
result FinDPO achieves state-of-the-art performance and maintains positive returns under realistic trading conditions.

BDC uses Distance Correlation for efficient Bayesian optimization of expensive functions.

problem Efficiently optimizing expensive black-box functions with Bayesian methods.
method Integrates Bayesian optimization with Distance Correlation for automatic exploration and exploitation.
result BDC performs similarly to popular BO methods on benchmark tests and real terrain optimization.

Foundation models improve volatility forecasting in finance.

problem Improving volatility forecasting in financial markets.
method Evaluation of TimesFM model, incremental fine-tuning, comparison with econometric benchmarks.
result Incremental fine-tuning improves forecast accuracy and outperforms traditional models.

Benchmark evaluates AI-generated financial QA hallucinations, highlighting system vulnerabilities.

problem Ensuring factual accuracy of AI-generated financial QA outputs.
method Developed a benchmark dataset and evaluated six detection methods under clean and noisy conditions.
result LLM-based judges and embedding methods perform best, but degrade under noisy conditions.

Generative Adversarial Networks simulate elevator group control without extensive data.

problem Lack of historical real-world data for system testing.
method Used GANs to generate simulation data for a multi-car elevator system.
result GANs can be used as substitutes for expensive simulation runs, but fine-tuning is needed.

BRAID fine-tunes diffusion models to optimize reward models in offline scenarios.

problem Combining generative modeling and model-based optimization in offline scenarios.
method Conservative fine-tuning of diffusion models using RL to optimize reward models.
result BRAID outperforms existing methods in offline data, avoiding invalid designs.

Study shows data attribution methods are sensitive to hyperparameters, making tuning costly.

problem Hyperparameter sensitivity in data attribution methods makes tuning impractical.
method Theoretical analysis and lightweight procedure for selecting regularization value without retraining.
result Proposes a lightweight procedure for selecting regularization value without model retraining.

Generative AI improves surrogate models by blending LF and HF data.

problem Data scarcity between high-fidelity and low-fidelity simulations.
method Probabilistic multi-fidelity surrogate framework using generative transfer learning.
result The model achieves HF accuracy with fewer HF evaluations.