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

4183124165 · Jun 202019922001200920172026
48 results for competency questions

Competency questions help experts select best clustering for energy data.

problem Ad hoc and subjective selection of clustering structures by domain experts.
method Formalize expert knowledge and requirements with competency questions.
result Competency questions improve reproducibility and evaluation of clustering applications.

This paper measures temperature in agent systems using volatility.

problem How to measure temperature in agent systems.
method Examined an agent system with two decision options in a news environment, established the measurement equation, and outlined the concept of temperature measurement.
result Illustrated a strategy for influencing average opinion in competing subsystems.

Improves online learning with expert demonstrations, quality matters.

problem Improving online learning through offline demonstration data.
method Thompson sampling applied to a multi-armed bandit model, informed by expert demonstrations and Bayes' rule.
result Substantial empirical regret reduction with expert demonstrations, improving online performance.

We study the problem of prediction for evolving graph data. We formulate the problem as the minimization of a convex objective encouraging sparsity and low-rank of the solution, that reflect natural graph properties. The convex formulation allows to obtain oracle inequalities and efficient solvers. We provide empirical…

2012-05-07abs ↗pdf ↗

Models necessarily capture only parts of a reality. Prediction models aim at capturing a future reality. In this paper we address the question of how the future is constructed (or: imagined) in an investment context where market participants form expectations on the returns of a risky investment. We observe that the pa…

2019-12-23abs ↗pdf ↗

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.

Autonomous multiple tasks learning is a fundamental capability to develop versatile artificial agents that can act in complex environments. In real-world scenarios, tasks may be interrelated (or "hierarchical") so that a robot has to first learn to achieve some of them to set the preconditions for learning other ones. …

2019-06-04abs ↗pdf ↗

Dynamic Ensemble Selection (DES) techniques aim to select locally competent classifiers for the classification of each new test sample. Most DES techniques estimate the competence of classifiers using a given criterion over the region of competence of the test sample (its the nearest neighbors in the validation set). T…

2018-04-18abs ↗pdf ↗

Estimating machine learning performance 'in the wild' is both an important and unsolved problem. In this paper, we seek to examine, understand, and predict the pointwise competence of classification models. Our contributions are twofold: First, we establish a statistically rigorous definition of competence that general…

2019-10-24abs ↗pdf ↗

Dynamic regressor selection (DRS) systems work by selecting the most competent regressors from an ensemble to estimate the target value of a given test pattern. This competence is usually quantified using the performance of the regressors in local regions of the feature space around the test pattern. However, choosing …

2019-04-09abs ↗pdf ↗

To make AI systems broadly useful for challenging real-world tasks, we need them to learn complex human goals and preferences. One approach to specifying complex goals asks humans to judge during training which agent behaviors are safe and useful, but this approach can fail if the task is too complicated for a human to…

2018-05-02abs ↗pdf ↗

SurvivalBoost improves prediction of event times in competing risks scenarios.

problem Predicting event times in scenarios with multiple possible outcomes.
method Developed a strictly proper censoring-adjusted scoring rule for stochastic optimization of competing risks.
result SurvivalBoost outperforms 12 state-of-the-art models across various metrics.

Survival analysis in the presence of multiple possible adverse events, i.e., competing risks, is a pervasive problem in many industries (healthcare, finance, etc.). Since only one event is typically observed, the incidence of an event of interest is often obscured by other related competing events. This nonidentifiabil…

2018-07-16abs ↗pdf ↗

Given the success of the gated recurrent unit, a natural question is whether all the gates of the long short-term memory (LSTM) network are necessary. Previous research has shown that the forget gate is one of the most important gates in the LSTM. Here we show that a forget-gate-only version of the LSTM with chrono-ini…

2018-04-13abs ↗pdf ↗

This paper uses neural networks to accurately model competing risks in survival analysis.

problem Ignoring competing risks leads to biased survival estimation in machine learning models.
method The paper introduces constrained monotonic neural networks to model each competing survival distribution.
result The method ensures exact likelihood maximization with reduced computational cost.

Study examines HTE estimation from time-to-event data with competing events.

problem Estimating HTEs from time-to-event data with competing events.
method Outcome modeling approach using plug-in estimators for potential outcomes.
result Competing events introduce new challenges for HTE estimation.

HACSurv models dependencies between competing risks and censoring for improved survival analysis.

problem Inaccurate survival predictions due to ignoring dependencies between competing risks and censoring.
method HACSurv uses hierarchical Archimedean copulas to model dependencies and cause-specific survival functions.
result HACSurv improves accuracy in survival predictions and captures complex risk interactions.

PyDTS analyzes survival data with discrete intervals and competing risks.

problem Discrete-time survival analysis with competing risks and optional penalization.
method Regularized estimation methods, model evaluation metrics, variable screening tools, and simulation module.
result Supports research and development in discrete-time survival analysis.

New method for discrete-time survival analysis with competing risks.

problem Discrete failure time data in survival analysis.
method Proposes a new estimation procedure for discrete-time survival analysis with competing events.
result Offers advantages over existing procedures and integrates regularized regression methods.

Prediction problems often admit competing models that perform almost equally well. This effect challenges key assumptions in machine learning when competing models assign conflicting predictions. In this paper, we define predictive multiplicity as the ability of a prediction problem to admit competing models with confl…

2019-09-14abs ↗pdf ↗

Dynamic ensemble selection systems work by estimating the level of competence of each classifier from a pool of classifiers. Only the most competent ones are selected to classify a given test sample. This is achieved by defining a criterion to measure the level of competence of a base classifier, such as, its accuracy …

2018-09-30abs ↗pdf ↗

The paper estimates personalized treatment effects in medical settings with competing risks.

problem Estimating treatment effectiveness for specific events in the presence of alternative event types.
method Meta-learners combining Cox regression or random survival forests for risk modeling and elastic net regression or random forests for direct CATE modeling.
result Compared meta-learners in multiple simulation settings, providing practical guidance for model selection.

CoPhy-PGNN tackles competing PG losses in neural networks for solving eigenvalue problems.

problem Solving eigenvalue problems with competing physics-guided loss functions.
method Learning generalizable solutions using a novel approach to handle competing PG losses.
result Demonstrates the effectiveness of the approach in quantum mechanics and electromagnetic propagation.

Paper introduces Decentralized Non-stationary Competing Bandits ( exttt{DNCB}) for dynamic matching markets.

problem Understanding dynamic two-sided matching markets with competing agents.
method Proposes a decentralized asynchronous learning algorithm ( exttt{DNCB}) for non-stationary environments.
result Obtains sub-linear (logarithmic) regret of exttt{DNCB} in dynamic settings.

Paper proposes FinAR-Bench to evaluate LLMs in financial analysis tasks.

problem Inaccurate financial analysis by LLMs leading to investment and regulatory issues.
method Proposes FinAR-Bench, a benchmark dataset with three steps: key info extraction, financial indicator calculation, and logical reasoning.
result LLMs perform better in key info extraction and indicator calculation but struggle with logical reasoning.

SSH-Net: A Deep Neural Network for Predicting Failure Time Distribution Functions under Competing Risks with GPU Data

problem Predicting failure time distribution functions under competing risks
method Structured Segmented Hazard Deep Neural Network (SSH-Net)
result Prediction accuracy validated through simulation studies and GPU data

Develops new methods to estimate treatment effects in survival data with competing risks.

problem Estimating treatment effects in survival data with competing risks.
method Censoring Unbiased Transformations (CUTs) for survival outcomes with and without competing risks.
result Consistent estimates of heterogeneous cumulative incidence effects and total effects using HTE learners.

Random forest models predict CLABSI risk in hospital admissions, with static models performing similarly to dynamic ones.

problem Predicting CLABSI risk in hospital admissions using EHR data with competing risks.
method Comparison of static and dynamic random forest models for binary, multinomial, survival, and competing risks outcomes.
result Static and dynamic random forest models perform similarly in predicting CLABSI risk, with multinomial models having the lowest computation times.

The stability analysis of socioeconomic systems has been centered on answering whether small perturbations when a system is in a given quantitative state will push the system permanently to a different quantitative state. However, typically the quantitative state of socioeconomic systems is subject to constant change. …

2014-08-29abs ↗pdf ↗

SurvTRACE uses transformers to analyze survival times with competing events.

problem Analyzing survival times with multiple competing events and confounders.
method Transformer-based model for survival analysis, handling competing events and confounders.
result SurvTRACE outperforms existing methods in multi-event scenarios.

Ensembling improves performance when classifiers disagree more than average.

problem When do ensembles provide significant performance improvements in classification tasks?
method Theoretical and empirical analysis of ensemble improvement rate and disagreement-error ratio.
result Ensembling improves performance significantly when the disagreement rate is large relative to the average error rate.

The Surprise index assesses autonomous systems' competency in uncertain environments.

problem Evaluating competency of autonomous systems in dynamic, uncertain environments.
method Surprise index, a measure that quantifies system performance based on available data.
result The Surprise index can be computed for dynamic systems with Gaussian marginal distributions.

SurvLatent ODE predicts VTE risk for cancer patients, outperforming current methods.

problem Predicting clinical outcomes from irregularly sampled EHR data with competing events.
method Neural ODE-based Recurrent Neural Networks (ODE-RNN) for flexible survival time estimation.
result SurvLatent ODE outperforms Khorana Risk scores for VTE risk prediction.

Study shows competition feedback can make ML predictors biased towards specific user groups.

problem How competition affects machine learning predictors and user prediction quality.
method Flexible model of competing ML predictors, empirical and mathematical analysis.
result Competition causes predictors to specialize for specific sub-populations at the cost of general performance.

Develops regression trees for estimating cumulative incidence curves in competing risks.

problem Estimating cumulative incidence functions in competing risks settings.
method Uses augmented estimators of the Brier score risk to build and prune regression trees.
result Demonstrates the utility of the proposed methods through simulation studies and real data.

How does supply uncertainty affect the structure of supply chain networks? To answer this question we consider a setting where retailers and suppliers must establish a costly relationship with each other prior to engaging in trade. Suppliers, with uncertain yield, announce wholesale prices, while retailers must decide …

2019-07-20abs ↗pdf ↗