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

53105158210 · Jun 202019922001200920172026
48 results for refinement strategy

The paper introduces a multilevel initialization method for deep neural networks.

problem Training very deep neural networks with layer-parallel methods.
method Continuous interpretation of training as optimal control, using time-dependent ODEs for neural network discretization, and a refinement strategy across the time domain.
result The method creates deep networks with good initializations from coarser networks, reducing training time and providing regularization.

New research shows label refinement and weak training have limitations for aligning LLMs.

problem Limitations of refinement methods for aligning large language models.
method Analyzed probabilistic assumptions and alternative approaches to label refinement and weak training.
result Label refinement and weak training suffer from irreducible error, leaving a performance gap.

Study refines trend-following strategy to improve adaptability.

problem Challenges in practical implementation of historical trend-following strategies.
method Modifications to historical strategy, including T-bills exclusion, alternative allocations, industry exclusions, momentum signals, and Walk-Forward Analysis.
result Persistent challenges in adapting historical strategies to modern markets.

Refined BN-S model improves crude oil hedging with machine learning.

problem Finding optimal hedging strategy for commodity markets.
method Implemented a refined Barndorff-Nielsen and Shephard model with machine learning algorithms.
result The refined model performs better than the classical BN-S model.

A new sampling strategy improves reliability and robustness optimization for complex designs.

problem High sample requirements for optimizing reliability and robustness in complex designs.
method Local Latin Hypercube Refinement (LoLHR) for multi-objective design uncertainty optimization.
result LoLHR achieves better results compared to other surrogate-based strategies.

We refine the analysis of hedging strategies for options under the SABR model carried out in [2]. In particular, we provide a theoretical justification of the empirical observation made in [2] that the modified delta ("Bartlett's delta") introduced there provides a more accurate and robust hedging strategy than the con…

2017-04-11abs ↗pdf ↗

Study examines volatility-based strategy for Chinese ETF options, improving returns in volatile markets.

problem Lack of effective trading strategies in volatile Chinese equity markets.
method Volatility forecasting using GARCH models to dynamically adjust positions and exposures.
result Dynamic adjustment of positions and exposures enhances returns in volatile markets.

Proposes GLWB-LTC for enhanced life care annuities with dynamic withdrawal strategies and stochastic interest rates.

problem Improving life care annuity features and pricing methods.
method Introduces GLWB-LTC with dynamic withdrawal strategies and stochastic interest rates. Solves the stochastic control problem using a robust tree method.
result Optimal withdrawal strategies vary over time with policyholder's health status, highlighting the advantage of flexibility.

Toehold purchase, defined here as purchase of one share in a firm by an investor preparing a tender offer to acquire majority of shares in it, reduces by one the number of shares this investor needs for majority. In the paper we construct mathematical models for the toehold and no-toehold strategies and compare the exp…

2012-04-10abs ↗pdf ↗

Study uses RNN for real-time crypto price prediction and trading optimization.

problem High volatility in cryptocurrency markets makes traditional forecasting models unreliable.
method Data collection, preprocessing, model refinement, and backtesting.
result Improved accuracy in real-time crypto price prediction and optimized trading strategies.

This paper refines the weighted strategy for non-stationary parametric bandits, improving regret bounds.

problem Non-stationary environments with gradual drifting patterns.
method Refined analysis framework for the weighted strategy in linear and generalized linear bandits.
result A simpler weight-based algorithm with improved regret bounds compared to previous studies.

Paper refines cross-lingual word embeddings using Manhattan norm.

problem Sensitivity of 2\ell_{2} norm loss function to outliers in CLWEs.
method Post-processing step using 1\ell_{1} norm to improve CLWEs.
result The 1\ell_{1} refinement substantially outperforms state-of-the-art baselines.

This paper refines the weighted strategy for non-stationary parametric bandits and MDPs, improving regret bounds.

problem Non-stationary environments with gradual drifting patterns.
method Refined analysis framework for the weighted strategy, leading to simpler and more efficient algorithms.
result Improved regret bounds for linear bandits, generalized linear bandits, and self-concordant bandits.

This work refines grid size selection for non-interactive private KK-means clustering.

problem Choosing the optimal number of grids for privatized KK-means clustering.
method Proposes a refined grid-size selection rule to minimize expected deviation in the K-means objective function.
result The proposed strategy results in more accurate clustering compared to prior work, even under tight privacy budgets.

As algorithmic prediction systems have become widespread, fears that these systems may inadvertently discriminate against members of underrepresented populations have grown. With the goal of understanding fundamental principles that underpin the growing number of approaches to mitigating algorithmic discrimination, we …

2019-04-22abs ↗pdf ↗

Maxout networks study gradients and propose initialization strategies.

problem Complexity in input-output Jacobian distribution complicates stable parameter initialization.
method Obtained bounds on moments of gradients and formulated initialization strategies.
result Parameter initialization strategies improve training of deep maxout networks.

We consider the problem of transfer learning in an online setting. Different tasks are presented sequentially and processed by a within-task algorithm. We propose a lifelong learning strategy which refines the underlying data representation used by the within-task algorithm, thereby transferring information from one ta…

2016-10-27abs ↗pdf ↗

CORE optimizes molecules by copying or generating substructures, improving accuracy.

problem Inaccurate substructure prediction in molecule optimization.
method Copy & Refine (CORE) strategy combining scaffolding tree generation and adversarial training.
result Significant improvement in various molecule optimization metrics.

Enhanced options trading strategies using advanced portfolio optimization.

problem Generating consistent positive returns in high-frequency options trading.
method Advanced portfolio optimization techniques applied to SPY options data.
result Sophisticated strategies incorporating advanced Greeks show potential in high-frequency trading.

A new sampling strategy for random Fourier features reduces computation time and improves prediction performance.

problem Efficient generation of random Fourier features for kernel approximation.
method Surrogate leverage weighted sampling guided by kernel alignment, avoiding matrix inversion.
result Time complexity reduced from O(ns^2+s^3) to O(ns^2), comparable or slightly better prediction performance.

FlowOE learns from experts to optimize financial trades.

problem Optimal execution in dynamic financial markets using static models.
method Imitation learning with flow matching models, incorporating refining loss function.
result Significantly outperforms expert models and traditional benchmarks.

The study finds cash productivity predicts stock performance in a specific subset of firms.

problem Predicting future stock performance using cash productivity.
method Using financial and market data, calculated cash returns as a proxy for operational efficiency, and tested a long-only strategy on Nasdaq-listed non-financial firms.
result Cash productivity has significant predictive power in a handpicked portfolio but limited across the broader Nasdaq universe.

We shrink confidence sets for equivalent discrete distributions using permutation equivalence.

problem Building high-probability confidence sets for equivalent discrete distributions.
method Exploiting permutation-equivalence to refine confidence sets.
result Confidence sets shrink at asymptotic rates of O(1/kKnk)O(1/\sqrt{\sum_{k\in \mathcal K} n_k}) and O(1/maxkKnk)O(1/\max_{k\in K} n_{k}).

New inequality for refined knot invariants in a specific space.

problem General adjunction inequality for refined ss-invariants does not hold.
method Introduced an adjunction inequality for a specific spatial refinement in kCP2k\overline{\mathbb{CP}^2}.
result An adjunction inequality holds for the ss-version of the Sq1Sq^1-refinement in kCP2k\overline{\mathbb{CP}^2}.

FlowHFT learns adaptive trading strategies from multiple models for diverse market conditions.

problem Traditional HFT models are limited by specific market conditions and cannot adapt to dynamic markets.
method FlowHFT uses flow matching policy to learn from multiple expert models and adapt to various market scenarios.
result FlowHFT consistently outperforms individual expert models in multiple market conditions.

We study refined topological string theory in the presence of orientifolds by counting second-quantized BPS states in M-theory. This leads us to propose a new integrality condition for both refined and unrefined topological strings when orientifolds are present. We define the SO(2N) refined Chern-Simons theory which co…

2012-02-20abs ↗pdf ↗

This study develops a NURBS-based method for conformal surface flattening without singularities.

problem Flatten surfaces conformally without singularities.
method NURBS-based approach with iterative refinement of input and flattening surfaces, leveraging nonlinear extension of VarPro.
result Developed a singularity-free NURBS-based method for conformal surface flattening.

Online BSP-Forest improves space partitioning for large-scale classification and regression.

problem Efficient space partitioning for large-scale classification and regression problems.
method Developed an online BSP-Forest framework that expands space coverage and refines partition structure in real-time.
result Guaranteed universal consistency for both classification and regression problems.

Refines neural network predictions using background knowledge for improved accuracy.

problem Compensate for lack of labeled data in neural networks.
method Introduces differentiable refinement functions and Iterative Local Refinement (ILR) algorithm to refine predictions efficiently and accurately.
result ILR finds competitive results in MNIST addition task and refines predictions on complex SAT formulas.

Study proposes DRL for investor-specific portfolio optimization considering asset volatility.

problem Dynamic allocation of funds balancing risk and return under market conditions.
method Volatility-guided Deep Reinforcement Learning (DRL) framework.
result Proposed DRL portfolios outperform baseline strategies.

We refine Khovanov homology in the presence of an involution on the link. This refinement takes the form of a triply-graded theory, arising from a pair of filtrations. We focus primarily on strongly invertible knots and show, for instance, that this refinement is able to detect mutation.

2019-07-31abs ↗pdf ↗

In a previous paper we constructed a spectrum-level refinement of Khovanov homology. This refinement induces stable cohomology operations on Khovanov homology. In this paper we show that these cohomology operations commute with cobordism maps on Khovanov homology. As a consequence we obtain a refinement of Rasmussen's …

2012-06-15abs ↗pdf ↗

Introduces SMMV preferences to avoid inconsistency in portfolio selection.

problem Monotone mean-variance preferences fail to differentiate strictly dominant payoffs.
method Introduces strictly monotone mean-variance preferences and applies them to portfolio selection problems.
result SMMV preferences provide a more rational basis for assessing prospects and coincide with MV preferences under certain conditions.

MountainLion uses LLMs to interpret financial data and generate investment strategies.

problem Challenges in integrating heterogeneous data for financial trading.
method Multi-modal LLM-based agents that process textual and visual data.
result Improves returns and investor confidence through interpretable investment framework.

MTRGL learns temporal correlations from multi-modal data for improved pair trading.

problem Discerning temporal correlations among financial entities.
method Combines time series data and discrete features into a temporal graph, using a memory-based temporal graph neural network.
result MTRGL outperforms traditional methods in temporal graph link prediction and pair trading.