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

4.2%8.3%12.5%16.7% · Sep 199519922001200920172026
48 results for dual stage

Dual-stage sEMG classification improves gesture recognition accuracy.

problem Improving accuracy in hand gesture recognition from sEMG signals.
method Dual-stage classification approach: first stage groups similar activities, second stage classifies within groups.
result Dual-stage classification yields significantly higher accuracy than single-stage approach.

We present a novel algorithm for non-linear instrumental variable (IV) regression, DualIV, which simplifies traditional two-stage methods via a dual formulation. Inspired by problems in stochastic programming, we show that two-stage procedures for non-linear IV regression can be reformulated as a convex-concave saddle-…

2019-10-27abs ↗pdf ↗

Improves classifier performance in multi-stage selection processes.

problem Difficulty in training classifiers in multi-stage selection processes due to varying sample sizes and information.
method Multi-Stage Transfer Learning (MSGTL) approach that uses knowledge from simpler classifiers trained in early stages to improve later stages.
result MSGTL outperforms other transfer learning methods in real-world selection process data.

Improves classifier performance in multi-stage processes with adversarial autoencoders and multi-task learning.

problem Challenges in training classifiers due to varying sample sizes and information content across stages.
method Combines adversarial autoencoders, multi-task learning, and semi-supervised learning to address underfitting and overfitting.
result Our approach outperforms state-of-the-art methods across different domains.

Paper introduces DTAE to optimize RL algorithms, balancing exploration and exploitation.

problem Balancing exploration and exploitation in reinforcement learning.
method Soft policy optimization with entropy and dual-track advantage estimator (DTAE).
result DTAE accelerates RL algorithm convergence and improves performance.

We consider a multi-objective risk-averse two-stage stochastic programming problem with a multivariate convex risk measure. We suggest a convex vector optimization formulation with set-valued constraints and propose an extended version of Benson's algorithm to solve this problem. Using Lagrangian duality, we develop sc…

2017-11-17abs ↗pdf ↗

Neural model accelerates SDDP for stochastic optimization.

problem Exponential complexity of SDDP limits its applicability to low-dimensional problems.
method Trainable neural model maps problem instances to a low-dimensional piecewise linear value function.
result ν-SDDP significantly reduces problem solving cost without sacrificing solution quality.

We investigate penalized maximum log-likelihood estimation for exponential family distributions whose natural parameter resides in a reproducing kernel Hilbert space. Key to our approach is a novel technique, doubly dual embedding, that avoids computation of the partition function. This technique also allows the develo…

2018-11-06abs ↗pdf ↗

Hybrid model predicts flow and pressure in water systems.

problem Predicting flow and pressure in water distribution systems with complex spatial-temporal correlations.
method Hybrid dual-stage spatial-temporal attention-based recurrent neural networks (hDS-RNN).
result Our model outperformed 9 baseline models in flow and pressure series prediction.

Framework uses deep learning and statistical models to solve PDEs with discontinuous coefficients.

problem Solving PDEs with discontinuous coefficients.
method Two-stage physics-informed deep learning and statistical mixture models.
result Framework achieves adaptability and accurate parameter identification.

We continue the study of the Strominger-Yau-Zaslow mirror symmetry conjecture. Roughly put, this states that if two Calabi-Yau manifolds X and Y are mirror partners, then X and Y have special Lagrangian torus fibrations which are dual to each other. Much work on this conjecture is necessarily of a speculative nature, a…

1998-09-14abs ↗pdf ↗

The paper tackles partial inference in structured prediction using a convex optimization approach.

problem Maximizing a score function with unary and pairwise potentials in graph label spaces.
method Generative model approach with two-stage convex optimization for label recovery.
result Conditions for recovering a majority of labels with provable guarantees.

Graph convolutional networks (GCNs) have recently become one of the most powerful tools for graph analytics tasks in numerous applications, ranging from social networks and natural language processing to bioinformatics and chemoinformatics, thanks to their ability to capture the complex relationships between concepts. …

2019-04-04abs ↗pdf ↗

This paper advances FL algorithms for composite optimization and statistical recovery.

problem Federated learning optimization and statistical recovery in composite settings.
method Proposes Fast Federated Dual Averaging for strongly convex and smooth loss, and Multi-stage Federated Dual Averaging for restricted strongly convex and smooth loss.
result Establishes state-of-the-art iteration and communication complexity, and high probability complexity bound with linear speedup.

A new conformal prediction framework for two-stage models identifies stage-wise uncertainty.

problem Limited coverage guarantees and lack of modular structure understanding in existing conformal prediction methods.
method Decomposes prediction residuals into stage-specific components, calibrates parameters using FWER control, and adapts to non-stationary settings.
result Improves coverage and identifies stage-wise error contributions compared to standard conformal methods.

To integrate strategic, tactical and operational decisions, the two-stage optimization has been widely used to guide dynamic decision making. In this paper, we study the two-stage stochastic programming for complex systems with unknown response estimated by simulation. We introduce the global-local metamodel assisted t…

2019-10-13abs ↗pdf ↗

Paper develops efficient algorithms for robust optimization across multiple groups.

problem Minimizing maximal empirical risk across distinct groups in robust optimization.
method Develops ALEG and ALEM algorithms for two-level finite-sum convex-concave minimax optimization.
result Achieves ε-accuracy with complexity O(m√(nlnm/ε)) and outperforms state-of-the-art methods.

PortBench benchmarks LLMs for PM, revealing their weaknesses in diversification and robustness.

problem Lack of benchmarks for LLM-driven portfolio management, especially in diversification and robustness.
method Developed a comprehensive benchmark with a static QA dataset and a dynamic allocation pipeline, introducing metrics to evaluate correlation and robustness.
result 90% of LLMs fail to outperform a basic equal-weight allocation, highlighting their limitations in diversification and robustness.

This paper explores the following question: what kind of statistical guarantees can be given when doing variable selection in high-dimensional models? In particular, we look at the error rates and power of some multi-stage regression methods. In the first stage we fit a set of candidate models. In the second stage we s…

2007-04-09abs ↗pdf ↗

StageNet improves health risk prediction by integrating disease stage information.

problem Improving health risk prediction for patients with chronic conditions.
method StageNet uses a stage-aware LSTM and stage-adaptive convolutional modules to extract and integrate disease stage information.
result StageNet achieves up to 12% higher AUPRC for risk prediction and over 58% higher Calinski-Harabasz score for patient subtyping compared to state-of-the-art models.

New theory extends rank-dependent utility for risk and ambiguity.

problem Modeling decision-making under risk and ambiguity.
method Axiomatizes a new preference relation with ambiguity index, probability weighting, and utility function.
result Extends rank-dependent utility to risk and ambiguity, reducing to existing models under specific conditions.

In many classification systems, sensing modalities have different acquisition costs. It is often {\it unnecessary} to use every modality to classify a majority of examples. We study a multi-stage system in a prediction time cost reduction setting, where the full data is available for training, but for a test example, m…

2012-05-20abs ↗pdf ↗

Graph neural network (GNN), as a powerful representation learning model on graph data, attracts much attention across various disciplines. However, recent studies show that GNN is vulnerable to adversarial attacks. How to make GNN more robust? What are the key vulnerabilities in GNN? How to address the vulnerabilities …

2019-05-09abs ↗pdf ↗

SDQL uses modular deep Q networks to efficiently learn multi-stage optimal control tasks.

problem Training complex deep reinforcement learning models for multi-stage control tasks is inefficient and unstable.
method Stacked Deep Q Learning (SDQL) with modular Q networks and backward training.
result SDQL efficiently learns optimal control policies for multi-stage tasks with high-dimensional state and action spaces.

Model predicts asset prices from initial shocks using neural networks.

problem Missing data on actual asset liquidations limits model calibration.
method Dual neural network structure, first stage maps shocks to liquidations, second stage uses liquidations to predict prices.
result Model accurately predicts equilibrium prices from initial shocks without liquidation data.

Machine learning can improve 2SLS first stage predictions, but nonlinear methods often introduce bias.

problem Improving the first stage of 2SLS using machine learning.
method Decomposed bias into three components, investigated through simulation.
result Nonlinear machine learning methods can introduce substantial bias in second-stage estimates.

We consider two stage estimation with a non-parametric first stage and a generalized method of moments second stage, in a simpler setting than (Chernozhukov et al. 2016). We give an alternative proof of the theorem given in (Chernozhukov et al. 2016) that orthogonal second stage moments, sample splitting and n1/4n^{1/4}-…

2017-04-12abs ↗pdf ↗

CycleFQI tackles offline reinforcement learning for cyclic MDPs, mitigating state distribution mismatch.

problem Offline reinforcement learning for cyclic MDPs with heterogeneous dynamics and discount factors.
method CycleFQI decomposes the cyclic process into stage-wise sub-problems, using vector of stage-specific Q-functions.
result CycleFQI mitigates the curse of dimensionality and provides finite-sample suboptimality error bounds.