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

2356 · Feb 202019922001200920172026
48 results for multi-stage pump

Neural network with data augmentation improves multi-stage pump prediction accuracy.

problem Predicting multi-stage pump external characteristics with high accuracy.
method Neural network model with data augmentation for multi-objective prediction.
result Neural network model with data augmentation outperforms other models in accuracy.

While pump-and-dump schemes have attracted the attention of cryptocurrency observers and regulators alike, this paper represents the first detailed empirical query of pump-and-dump activities in cryptocurrency markets. We present a case study of a recent pump-and-dump event, investigate 412 pump-and-dump activities org…

2018-11-25abs ↗pdf ↗

Detects and traces masterminds behind cryptocurrency pump-and-dump schemes.

problem Identifying and tracing the entities organizing cryptocurrency manipulation.
method Collects real-time data from social networks and cryptocurrency markets, constructs temporal attributed graphs, and uses GNN to identify masterminds.
result Achieves higher F1 scores and precision than state-of-the-art fraud detection methods, detects 438 masterminds.

Predicts cryptocurrency pump probability using sequence-based neural networks.

problem Detecting pump-and-dump schemes in cryptocurrency markets.
method Developed a sequence-based neural network (SNN) that encodes historical P&D events into sequences for prediction.
result SNN improves prediction accuracy by leveraging positional attention to extract useful information.

Study analyzes cryptocurrency pump-and-dump dynamics using minute-level data.

problem Identifying and quantifying insider trading in cryptocurrency markets.
method Algorithmic identification of insider volume spikes, conservative profit bounds calculation, social-media verification.
result Median returns above 100%, upper-quartile returns exceeding 2000% for insider profits.

Interest surrounding cryptocurrencies, digital or virtual currencies that are used as a medium for financial transactions, has grown tremendously in recent years. The anonymity surrounding these currencies makes investors particularly susceptible to fraud---such as "pump and dump" scams---where the goal is to artificia…

2019-02-04abs ↗pdf ↗

Novel framework identifies pump-specific deterioration rates using Bayesian hierarchical hazard modeling and causal discovery.

problem Challenges in asset management due to heterogeneous deterioration rates in pump equipment.
method Bayesian hierarchical hazard modeling with causal discovery, GPU-accelerated No-U-Turn Sampling (NUTS), and DirectLiNGAM.
result Identified striking heterogeneity in deterioration rates, with negative effects 400 times larger than positive effects.

Study improves detection of cryptocurrency pump-and-dump schemes.

problem Class imbalance in P&D detection due to rare events.
method Synthetic Minority Oversampling Technique (SMOTE) and ensemble learning models.
result XGBoost and LightGBM achieved high recall rates (94.87% and 93.59%) with strong F1-scores.

New AI method improves anomaly detection across different IIoT sensors.

problem Poor performance of anomaly detection models when applied to different machines.
method Robust AI method using pre-processing and multiple models on different pumps.
result Models perform well across different environments and types of pumps.

Improves disentangled representation learning with multi-stage modeling.

problem Trade-off between disentanglement and reconstruction quality in autoencoders.
method Penalty-based disentanglement learning followed by detail information modeling.
result Higher reconstruction quality than state-of-the-art methods with equivalent disentanglement.

This paper develops a learning framework for optimal strategies in multi-stage decentralized matching markets.

problem Optimal strategies in multi-stage decentralized matching markets with uncertain preferences.
method Nonparametric statistical approach and variational analysis.
result Participants can be better off with multi-stage matching compared to single-stage matching.

Multi-stage financial decision optimization under uncertainty depends on a careful numerical approximation of the underlying stochastic process, which describes the future returns of the selected assets or asset categories. Various approaches towards an optimal generation of discrete-time, discrete-state approximations…

2009-12-08abs ↗pdf ↗

Study identifies 1,012 persistent wallet cohorts on Solana pump.fun, showing coordinated buying behavior.

problem Understanding coordinated buying behavior on Solana pump.fun.
method Two-stage detection pipeline: first-buyer-window extraction followed by persistent-cohort surfacing via graph co-occurrence.
result 1,012 persistent wallet cohorts identified, showing systematic co-buying across multiple launches.

CSAC enables cooperative reinforcement learning for multi-stage tasks.

problem Coordinating consecutive reinforcement learning agents for long-term multi-stage tasks.
method CSAC modifies each agent's policy to maximize both current and next agent's critic.
result CSAC outperforms uncooperative policies and single-agent training in multi-room maze domain.

New method designs experiments robustly for nonlinear estimation, improving parameter knowledge.

problem Designing robust experiments for nonlinear estimation under parametric uncertainty.
method Multi-stage robust optimization framework for sequential experiments.
result Identifies experiments better conducted early for improved parameter knowledge.

Model financial markets with social media influences using hierarchical networks.

problem Understanding social media's impact on financial markets.
method Agent-based model with hierarchical influence network.
result Model accurately simulates real-world financial market behaviors.

Estimates and infers multi-stage stationary treatment policies with variable selection.

problem Valid inference for multi-stage stationary treatment policies with high-dimensional feature variables.
method Estimate the value function using augmented inverse probability weighted estimator, apply penalty for variable selection, construct one-step improvements for valid inference.
result Improved estimators are asymptotically normal, valid inference for policy parameters demonstrated.

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.

Guided Learning improves end-to-end modeling for multi-stage decision-making.

problem Challenges in training unified neural networks for multi-stage decision-making.
method Guided Learning framework with a guide function and utility function.
result Significant improvement in performance over traditional methods.

Adaptive multi-stage density ratio estimation improves learning of latent space EBM.

problem Learning energy-based models in latent space is computationally expensive and challenging.
method Adaptive multi-stage density ratio estimation using NCE to bridge the gap between prior and posterior densities.
result The method enables more expressive prior models and sharpens the latent space EBM.

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.

Survival analysis of 832,941 Solana token launches shows a significant decline in graduation rate.

problem Analyzing the survival rate of Solana token launches and identifying factors affecting graduation.
method Survival analysis using Kaplan-Meier and Cox proportional-hazards models.
result The survival rate of Solana token launches has declined significantly, with a 3.18x decrease from previous rates.

Estimates time-varying network connections using multi-stage smoothing.

problem Estimating edge probabilities of time-varying networks.
method Multi-stage smoothing: temporal local smoothing followed by node-domain smoothing.
result Captures both smooth temporal evolution and structural patterns in connectivity.

This paper proposes a cascading failure mitigation strategy based on Reinforcement Learning (RL) method. Firstly, the principles of RL are introduced. Then, the Multi-Stage Cascading Failure (MSCF) problem is presented and its challenges are investigated. The problem is then tackled by the RL based on DC-OPF (Optimal P…

2019-08-19abs ↗pdf ↗

Deep neural networks can grok better than shallow ones, showing multi-stage generalization.

problem Understanding the generalization behavior of deep neural networks.
method Empirical replication and analysis of grokking phenomenon in deep MLP models.
result Deep neural networks exhibit multi-stage generalization, with a secondary surge in test accuracy.

Study uses deep neural networks for causal inference tasks, especially in high-dimensional settings.

problem Challenges in direct estimation for complex causal inference tasks.
method Sequential multi-stage learning with doubly robust deep neural networks.
result Theoretical guarantees for DNNs' effectiveness in high-dimensional causal inference.

A number of recent work studied the effectiveness of feature selection using Lasso. It is known that under the restricted isometry properties (RIP), Lasso does not generally lead to the exact recovery of the set of nonzero coefficients, due to the looseness of convex relaxation. This paper considers the feature selecti…

2011-06-03abs ↗pdf ↗

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 ↗

We consider the problem of learning multi-stage vision-based tasks on a real robot from a single video of a human performing the task, while leveraging demonstration data of subtasks with other objects. This problem presents a number of major challenges. Video demonstrations without teleoperation are easy for humans to…

2018-10-25abs ↗pdf ↗

Multi-task sparse feature learning aims to improve the generalization performance by exploiting the shared features among tasks. It has been successfully applied to many applications including computer vision and biomedical informatics. Most of the existing multi-task sparse feature learning algorithms are formulated a…

2012-10-22abs ↗pdf ↗

Generative adversarial networks (GAN) have recently been shown to be efficient for speech enhancement. However, most, if not all, existing speech enhancement GANs (SEGAN) make use of a single generator to perform one-stage enhancement mapping. In this work, we propose to use multiple generators that are chained to perf…

2020-01-15abs ↗pdf ↗

New model explains price dynamics of Bitcoin with psychological factors.

problem Understanding price variations in cryptocurrency markets with psychological factors.
method Extended agent-based model with heterogeneous psychological parameters.
result Model shows diverse dynamics based on psychological correlation.