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

Trend · papers per month

127254380507 · Jun 202019922001200920182026
48 results for DT prediction

DeepDTA predicts drug-target binding affinities using deep learning.

problem Predicting the continuum of binding strength values between drugs and targets.
method Uses deep learning, specifically CNNs, to model 1D representations of drug and target sequences.
result Deep learning model outperforms state-of-the-art methods in predicting DT binding affinities.

Decision tree predicts DV recidivism with interpretable models.

problem Predicting DV re-offending to aid risk assessment and victim protection.
method Employed decision tree induction to balance accuracy and interpretability, addressing class imbalance and feature selection.
result Achieved comparable accuracy with 3 features and understandable 4-node trees.

This study examines hyperparameter tuning for CART and C4.5 DT algorithms.

problem Finding optimal hyperparameters for DT algorithms to improve predictive performance.
method Comprehensive empirical study with 94 datasets, using IRACE for tuning.
result Different HP profiles provide significant improvements for CART, but less for C4.5.

Proposes DTS framework to predict CTR by tracking user interest evolution over time.

problem Predicting CTR by ignoring dynamic user interest changes over time.
method Integrates time information using ODEs in a neural network to model interest evolution.
result Achieves superior CTR prediction performance compared to existing methods.

Let XX be a compact complex Calabi-Yau 4-fold. Under certain assumptions, we define Donaldson-Thomas type deformation invariants (DT4DT_{4} invariants) by studying moduli spaces of solutions to the Donaldson-Thomas equations on XX. We also study sheaves counting problems on local Calabi-Yau 4-folds. We relate DT4DT_{4}

2014-07-29abs ↗pdf ↗

The article finds non-Abelian DT-instantons on non-Kähler manifolds.

problem Finding solutions to DT-instanton equations on non-Kähler manifolds.
method Constructing examples of DT-instantons for homogeneous almost Hermitian structures on the manifold of full flags in C^3.
result Explicit classification and phenomena of reducibility and disappearance of DT-instantons.

Optimal model improves AUC, recall, and F1 score for class-imbalanced business risk.

problem Improving prediction of class-imbalanced business risk.
method Resampling, regularization, and model ensembling techniques.
result Boosting on DT with SMOTE oversampling achieves AUC, recall, and F1 score of 0.8633, 0.9260, and 0.8907, respectively.

Enhances RL in target domains with limited data using augmented return.

problem Utilize data from an accessible source domain to improve policy learning in a target domain with scarce data.
method Return Augmented Decision Transformer (REAG) method, which augments the return in the source domain to align with the target domain's optimal trajectory distribution.
result The proposed REAG method achieves the same level of suboptimality as without a dynamics shift, enhancing DT type frameworks' performance in off-dynamics RL.

Enhanced VAE with DT improves flexibility in latent variable modeling.

problem Limitations of VAE's diagonal covariance matrix in matching true posterior distribution.
method Proposes dyadic transformation (DT) to model multivariate normal distributions.
result DT enhances posterior flexibility and achieves competitive results.

Study evaluates digital transformation impact on financial performance using LLMs.

problem Measuring and understanding the impact of digital transformation on financial performance.
method Constructed DT indicators from company reports; analyzed effects of different digital technologies.
result Digital transformation improves financial performance, but varies by technology.

This research assesses uncertainty quantification and sensitivity analysis for DTs in nuclear fuel performance.

problem Understanding the reliability and performance of advanced nuclear fuels using DTs.
method Introduces ML-based uncertainty quantification and sensitivity analysis methods applied to BISON fuel performance code.
result Demonstrates the effectiveness of DTs in multi-criteria decision-making for nuclear fuel performance.

Study uses AI techniques to predict bank customer solvency.

problem Predicting the solvency of bank customers.
method Data preprocessing, CART decision tree method, SPSS tool.
result Model accuracy and precision of 71%, error rate of 29%.

Mathematical advances needed for Digital Twins, differing from traditional models.

problem Foundational mathematical advances required for Digital Twins.
method Multi-scale, multi-physics modeling and coupling, different reliability criteria and uncertainty assessments.
result AI/ML methods can perform well in biomedical problems but fail in simple engineering systems.

Mammography is the most effective and available tool for breast cancer screening. However, the low positive predictive value of breast biopsy resulting from mammogram interpretation leads to approximately 70% unnecessary biopsies with benign outcomes. Data mining algorithms could be used to help physicians in their dec…

2013-05-30abs ↗pdf ↗

The paper constructs Darboux transforms for a specific hierarchy and its related flows.

problem Constructing and analyzing Darboux transforms for the B^n(1)\hat B_n^{(1)}-hierarchy.
method Using loop group factorization, the authors construct Darboux transforms and provide Permutability and scaling formulas.
result Explicit soliton solutions are constructed and provided for specific flows.

Paper proposes a new method to secure power system operation using machine learning.

problem Ensuring secure power system operation under high uncertainty.
method Embedding disjunctive rules from Decision Trees in an optimization framework using GDP and a two-step search method.
result The method achieves efficient system control at a marginal increase in system price compared to an oracle model.

GDT improves reinforcement learning by matching future state information efficiently.

problem Efficient learning of multi-task policies from trajectory data.
method Generalized Decision Transformer (GDT) for offline hindsight information matching.
result GDT enables effective offline multi-task state-marginal matching and imitation learning.

DTS improves inference-time alignment of diffusion models with less compute.

problem Inference-time alignment of diffusion models suffers from inaccurate value estimation and inefficient reuse of past computations.
method Diffusion Tree Sampling (DTS) uses a tree-based approach to propagate terminal rewards and iteratively refine value estimates.
result DTS produces asymptotically exact samples and matches the FID of best-performing baselines with up to 10x less compute.

A new Bayesian model improves dynamic texture segmentation.

problem Automatic selection of DTs in video sequences.
method Joint Dirichlet process mixture and GDTM approach with VBEM and RTSS.
result The proposed algorithm outperforms previous methods in efficiency and accuracy.

Improved aircraft structure prediction using derivative-enhanced sparse Cholesky GP method.

problem Accurate real-time prediction of aircraft structure performance.
method Combining derivative data with a modified dynamic sparse Cholesky linear system solver.
result Improved prediction accuracy of aircraft structure performance.

Growth of monetary assets and debts is commonly described by the formula of compound interest which for the case of continuous compounding is the exponential growth law. Its differential form is dc/dt = i c where dc/dt describes the rate of monetary growth, i the compounded interest rate and c the actual principal. Exp…

2012-04-30abs ↗pdf ↗

New rule reduces exploration regret to logarithmic, improving bad episode handling.

problem Improving exploration regret in average reward MDPs.
method Replacing Doubling Trick with Vanishing Multiplicative rule in EVI-based algorithms.
result Regret is logarithmic under the new rule, significantly better than linear.

Paper proposes DG-ETC for online submodular maximization with stochastic bandit feedback.

problem Online unconstrained submodular maximization with stochastic bandit feedback.
method Double-Greedy - Explore-then-Commit (DG-ETC) approach.
result DG-ETC achieves logarithmic regret O(dlog(dT))O(d\log(dT)) for 1/21/2-approximate pseudo-regret.

DTS improves robustness of bandit algorithms in nonstationary environments.

problem Brittle behavior of multi-armed bandit algorithms in nonstationary exogenous factors.
method Deconfounded Thompson Sampling (DTS) that projects population-level performance while controlling for context.
result DTS provides resilience to exogenous variation and balances exploration and exploitation.

Researchers use DT to transfer policies from one environment to another using causal reasoning.

problem Adapting to changes in environmental dynamics in reinforcement learning.
method Applying causal counterfactual reasoning to Decision Transformer (DT) architecture for policy transfer.
result DT successfully transfers a learned policy to new environments while retaining most of the reward.

Study computes isoperimetric profiles in low-dimensional Riemannian products.

problem Estimating isoperimetric profiles in Riemannian products.
method Symmetrization techniques for product manifolds.
result Explicit lower bounds for isoperimetric profiles in T2imesRnT^2 imes \mathbb{R}^n and T3imesR4T^3 imes \mathbb{R}^4.

Mathematical structures link Gromov-Witten to Donaldson-Thomas invariants.

problem Understanding non-perturbative topological string theory.
method Borel summation of Gromov-Witten potential and analysis of Stokes phenomena.
result Stokes phenomena encode Donaldson-Thomas invariants of the resolved conifold.

Proposes DT-LET for better transfer learning between domains with different resolutions.

problem Transfer learning between domains with different resolutions often fails due to mismatched hidden layers.
method Develops DT-LET model to find the best matching layers for transfer based on high-level feature correspondence.
result DT-LET achieves superior results in cross-domain recognition/classification tasks, validating the necessity of layer correspondence searching.

Study biharmonic submanifolds in warped product structures.

problem Characterize biharmonic submanifolds in warped product spaces.
method Analyze tension and bitension fields, relate to warping function and geometry of submanifolds.
result Characterize tangentially and normally biharmonic cases via differential conditions on the warping function.

In this paper we propose a synergistic melting of neural networks and decision trees (DT) we call neural decision trees (NDT). NDT is an architecture a la decision tree where each splitting node is an independent multilayer perceptron allowing oblique decision functions or arbritrary nonlinear decision function if more…

2017-02-23abs ↗pdf ↗

The study examines the properties of mapping class groups under specific Dehn twist subgroups.

problem Characterizing the structure of mapping class groups under Dehn twist subgroups.
method Analyzes the mapping class group MCG(Σg,p)/DTMCG(Σ_{g,p})/DT for various gg and pp, using properties of hyperbolic graphs and actions.
result The mapping class group MCG(Σg,p)/DTMCG(Σ_{g,p})/DT is hyperbolic in low complexity cases.

We develop DTs for PDE models using KL-NN and TL, analyzing TL's moment equations and one-shot learning for exactness.

problem Creating accurate digital twins for systems governed by PDEs under changing conditions.
method We use KL-NN surrogate models and transfer learning to construct DTs, analyzing the moment equations and proposing one-shot and few-shot learning methods.
result For linear PDEs, one-shot TL is exact; for nonlinear PDEs, some parameters can be transferred with minimal error.

Neural networks estimate SDEs with jump noise using a Tamed-Milstein scheme.

problem Estimating drift and diffusion functions in SDEs with jump noise.
method Tamed-Milstein scheme with neural networks as non-parametric approximators.
result Flexible estimation of complex nonlinear dynamics in systems with state-dependent noise.

We review a construction of hyperkahler metrics proposed in joint work of Davide Gaiotto, Greg Moore and the author. A key ingredient in this construction is a collection of integer "DT invariants" obeying the wall-crossing formula of Kontsevich-Soibelman.

2013-08-09abs ↗pdf ↗

Study online pricing with contextual elasticity and heteroscedastic valuation.

problem Online contextual dynamic pricing with customer decision based on features and price.
method Introduced a novel approach to modeling customer demand with feature-based price elasticity and heteroscedastic noise. Proposed an efficient algorithm called Pricing with Perturbation (PwP).
result Proved an O(dTlogT)O(\sqrt{dT\log T}) regret bound for the algorithm, matching a lower bound of Ω(dT)Ω(\sqrt{dT}).