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

Trend · papers per month

3176349511,268 · Jun 202019922001200920172026
48 results for rating data

Framework integrates financial and annual report data for better corporate credit ratings.

problem Lack of insights from non-financial data in credit rating models.
method Uses FinBERT to extract features from annual reports and combines them with financial data.
result Improves credit rating accuracy by 8-12%.

A non-trivial probability structure is evident in the binary data extracted from the up/down price movements of very high frequency data such as tick-by-tick data for USD/JPY. In this paper, we analyze the Sony bank USD/JPY rates, ignoring the small deviations from the market price. We then show there is a similar non-…

2005-09-30abs ↗pdf ↗

Active data collection improves convergence rates in operator learning.

problem Improving convergence rates in operator learning with linear target and stochastic input.
method Active data collection strategies with mean-zero stochastic process and continuous covariance kernels.
result Achieves arbitrarily fast error convergence rates with eigenvalue decay of covariance kernels.

This research examines how the error rate of nearest neighbor classifiers varies with dataset size.

problem The scaling of classification error rates with dataset size is not uniform.
method Theoretical analysis of nearest neighbor classifiers, focusing on early and late phases of dataset size.
result The error rate of nearest neighbor classifiers can have fine-grained rates depending on the dataset size and data distribution.

IUS framework predicts EUR/USD exchange rate with improved accuracy.

problem Accurate forecasting of EUR/USD exchange rate.
method Combines large language models for sentiment analysis, deep learning for forecasting, and feature selection.
result Optuna-optimized Bi-LSTM model reduces MAE and RMSE by 10.69% and 9.56% respectively.

Most of the existing recommender systems use the ratings provided by users on individual items. An additional source of preference information is to use the ratings that users provide on sets of items. The advantages of using preferences on sets are two-fold. First, a rating provided on a set conveys some preference in…

2019-04-22abs ↗pdf ↗

This paper uses LLMs to improve equity stock ratings by ingesting diverse financial and news data.

problem Challenges in traditional stock rating methods, including data overload, inconsistencies, and delayed reactions.
method Application of LLMs to generate multi-horizon stock ratings using various datasets.
result LLMs enhance the accuracy and consistency of stock ratings, outperforming traditional methods in forward returns.

CCR-CNN uses CNN to predict corporate credit ratings from financial data.

problem Lack of data and limited model performance in predicting corporate credit ratings.
method Transform corporations into images and use CNN to analyze complex feature interactions.
result CCR-CNN outperforms state-of-the-art methods in predicting corporate credit ratings.

Paper studies CLT rates for dependent data in Wasserstein-p distance.

problem CLT rates for multivariate dependent data in Wasserstein-p distance.
method Analyzes locally dependent sequences and geometrically ergodic Markov chains.
result Establishes optimal W1W_1 CLT rates and WpW_p (p2p\ge 2) rates for dependent data.

The paper models rating transitions and calibrates them to market data for XVA calculations.

problem Calibrating rating models to both historical and market data for accurate XVA calculations.
method Modeling rating transitions as a Markov chain, calibrating to historical and market data, proposing a novel calibration procedure.
result Improved XVA scheme through better calibration of rating models.

We calibrate and test various variants of field theory models of the interest rate with data from eurodollars futures. A model based on a simple psychological factor are seen to provide the best fit to the market. We make a model independent determination of the volatility function of the forward rates from market data…

2002-08-27abs ↗pdf ↗

Continuous, ubiquitous monitoring through wearable sensors has the potential to collect useful information about users' context. Heart rate is an important physiologic measure used in a wide variety of applications, such as fitness tracking and health monitoring. However, wearable sensors that monitor heart rate, such …

2019-12-18abs ↗pdf ↗

Estimates rate-distortion function for large datasets using neural networks.

problem Designing lossy data compression schemes and comparing them with theoretical limits.
method Re-formulate rate-distortion objective and solve using neural networks.
result NERD accurately estimates the rate-distortion function for real-world datasets.

Rate-In dynamically adjusts dropout rates during inference to improve uncertainty estimation in neural networks.

problem Static dropout rates lead to suboptimal uncertainty estimates in neural networks.
method Rate-In dynamically adjusts dropout rates using information-theoretic principles.
result Rate-In improves calibration and sharpens uncertainty estimates compared to fixed or heuristic dropout rates.

Exact risk and learning rate curves derived for adaptive SGD on high-dimensional problems.

problem Analyzing risk and learning rate dynamics in high-dimensional optimization problems.
method Developed a framework to give exact expressions for risk and learning rate curves using ODEs.
result Exact expressions for risk and learning rate curves, with detailed analysis of two adaptive learning rates.

Paper analyzes deep learning models for credit rating prediction using text and numerical data.

problem Improving credit rating prediction using multi-modal deep learning.
method Testing different deep learning models and fusion strategies for structured and unstructured datasets.
result CNN-based multi-modal model with two fusion strategies outperformed other models.

We first show that there are in fact triangular arbitrage opportunities in the spot foreign exchange markets, analyzing the time dependence of the yen-dollar rate, the dollar-euro rate and the yen-euro rate. Next, we propose a model of foreign exchange rates with an interaction. The model includes effects of triangular…

2002-02-22abs ↗pdf ↗

Study shows deep linear networks can converge to flatter minima at large learning rates.

problem Understanding the implicit bias of deep linear networks at large learning rates.
method Characterization of deep linear networks for binary classification using logistic loss in the large learning rate regime.
result Gradient descent iterates converge to a flatter minimum in the catapult phase for certain data separation conditions.

Rating prediction is an important application, and a popular research topic in collaborative filtering. However, both the validity of learning algorithms, and the validity of standard testing procedures rest on the assumption that missing ratings are missing at random (MAR). In this paper we present the results of a us…

2012-06-20abs ↗pdf ↗

Crowdsourcing is an effective tool for human-powered computation on many tasks challenging for computers. In this paper, we provide finite-sample exponential bounds on the error rate (in probability and in expectation) of hyperplane binary labeling rules under the Dawid-Skene crowdsourcing model. The bounds can be appl…

2013-07-10abs ↗pdf ↗

Study expands multiclass classification models with new rates and partial concept classes.

problem Multiclass classification with a bounded number of labels under various conditions.
method Extends traditional PAC model to distribution-dependent and data-dependent learning rates, characterizes optimal rates for universal and partial concept classes.
result Characterizes three types of learning rates (exponential, linear, arbitrarily slow) for fixed distributions and complexity measures for partial concept classes.

MOB-dS uses permutation to correct for dependency in discrete survival data.

problem Identifying subgroups in discrete event time data with potential spurious results.
method Model-based recursive partitioning (MOB) with modified data matrix and permutation test.
result MOB-dS controls type I error rate better than standard MOB for discrete survival data.

New research shows unlabeled data is equally valuable as labeled data in certain semi-supervised learning scenarios.

problem Improving learning performance with limited labeled data.
method Statistical models with continuous parameters, showing equal utility of unlabeled data under specific conditions.
result The learning rate of semi-supervised learning scales similarly to supervised learning when unlabeled data is abundant.

Paper improves classification rates for private data.

problem Classifying data with privacy constraints and relaxed assumptions.
method Introduced a novel approach for classification under privacy constraints, relaxing the strong density assumption.
result Achieved minimax optimal convergence rates without strong density assumption.

Study examines how data augmentation impacts optimization in linear regression.

problem Understanding how data augmentation schedules affect optimization in linear regression.
method Analyzed the effect of augmentation on optimization in linear regression with MSE loss, using classical convex optimization and recent work on implicit bias.
result Proved that under certain joint schedules for learning rate and augmentation scheme, augmented gradient descent converges and characterized the resulting minimum.

Paper analyzes faster convergence rates for reinforcement learning from offline data.

problem Analyzing faster convergence rates for reinforcement learning from offline data.
method Fine analysis of reinforcement learning from offline data, providing fast rates for regret convergence.
result The paper provides fast rates for the regret convergence, showing that the level of exponentiation depends on the noise in the decision-making problem.

Large learning rates cause oscillations in NN weights that improve generalization.

problem Improving generalization of neural networks trained with large learning rates.
method Theoretical analysis and feature-noise data generation model.
result Oscillating SGD with large learning rates benefits NN generalization by effectively learning weak features.

New guarantees for ERM with adaptively collected data.

problem Failure of ERM guarantees with adaptively collected data.
method Importance sampling weighted ERM algorithm with maximal inequality.
result First generalization guarantees and fast convergence rates for adaptively collected data.

In banking practice, rating transition matrices have become the standard approach of deriving multi-year probabilities of default (PDs) from one-year PDs, the latter normally being available from Basel ratings. Rating transition matrices have gained in importance with the newly adopted IFRS 9 accounting standard. Here,…

2017-07-31abs ↗pdf ↗

The paper uses machine learning and Lie groups to improve rating transitions and XVA calculations.

problem Improving rating transitions and XVA calculations using machine learning and Lie groups.
method Modeling rating transitions as SDEs on Lie groups, calibrating to historical and market data, applying Girsanov theorem, and using Deep Learning.
result Improves rating transitions and XVA calculations, making the model more robust.

This paper reviews methods for distributed training of machine learning models from high-rate streams.

problem Training machine learning models from high-rate distributed streams in a compute- and bandwidth-limited setting.
method Recently developed methods for large-scale distributed stochastic optimization.
result There exist regimes where systems can learn from distributed, streaming data at order-optimal rates.

This paper reviews methods for constructing confidence intervals for error rates in 1:1 matching tasks.

problem Challenges in assessing uncertainty of error rates in matching algorithms, especially when data are dependent and error rates are low.
method Derives and examines statistical properties of methods for constructing confidence intervals for error rates in 1:1 matching tasks.
result Coverage and interval width vary with sample size, error rates, and data dependence.

For environmental problems such as global warming future costs must be balanced against present costs. This is traditionally done using an exponential function with a constant discount rate, which reduces the present value of future costs. The result is highly sensitive to the choice of discount rate and has generated …

2013-11-16abs ↗pdf ↗

Optimal learning rate schedules for SGD in changing data distributions.

problem Minimizing regret in online learning with changing data distributions.
method Characterized optimal schedules for linear regression, proposed schedules for general convex and non-convex losses, and defined a notion of regret for non-convex losses.
result Upper and lower bounds for regret with constants for convex losses, and an upper bound on total expected regret for non-convex losses.

BEER accelerates decentralized nonconvex optimization to O(1/T)O(1/T) rate.

problem Communication bottleneck in decentralized machine learning.
method Communication-compressed algorithm with gradient tracking.
result Converges at O(1/T)O(1/T) rate, matching uncompressed performance.