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

1345 · Jun 202019922001200920172026
48 results for ants

Study of ants' movement rules on a 6D space, revealing distribution structures and singular trajectories.

problem Understanding the movement patterns of ants in a 6D space.
method Analyzing mechanical system rules to derive distribution structures and singular trajectories.
result Distributions and singular trajectories of ants' movement rules in a 6D space.

Ant colonies and boosting algorithms both reduce bias and variance through adaptive mechanisms.

problem Understanding the mathematical principles behind ensemble learning and ant colony behavior.
method Developed a formal mapping between AdaBoost's adaptive reweighting and ant recruitment dynamics.
result Proved that the fundamental theorem of weak learnability has a direct analog in colony decision-making.

NetDP predicts loan defaults using network data, addressing cold-start issues.

problem Cold-start problem in default prediction for new users.
method Combines unsupervised and supervised network representations, using parameter-server for scalability.
result Effectiveness in cold-start problem, especially for new users.

ANT improves TS diffusion models by automatically determining noise schedules.

problem Suboptimal performance of TS diffusion models due to lack of domain-specific noise schedules.
method ANT proposes an adaptive noise schedule that automatically determines proper noise schedules for TS datasets based on their statistics.
result ANT achieves state-of-the-art performance on various TS tasks, including forecasting, refinement, and generation.

ANT learns sparse embeddings for large vocabularies efficiently.

problem Lack of scalable methods for embedding large vocabularies in neural networks.
method Anchor & Transform (ANT) algorithm that learns a small set of anchor embeddings and a sparse transformation matrix.
result ANT achieves stronger performance with fewer parameters (up to 40x compression) compared to existing methods.

With the explosive growth of e-commerce and the booming of e-payment, detecting online transaction fraud in real time has become increasingly important to Fintech business. To tackle this problem, we introduce the TitAnt, a transaction fraud detection system deployed in Ant Financial, one of the largest Fintech compani…

2019-06-18abs ↗pdf ↗

This study shows how social insects and machine learning methods share a common mathematical framework.

problem Understanding how decentralized systems achieve optimal decision-making.
method Developed a rigorous mathematical framework to show isomorphism between ant colonies and ensemble machine learning.
result Demonstrated that ant colony decision-making and random forest learning implement identical variance reduction strategies through decorrelation of identical units.

Framework selects real estate redevelopment uses by integrating value, risk, complexity, and irreversibility.

problem Persistent underperformance of real estate assets due to structural misalignment.
method Integrates real-options logic and multi-criteria decision analysis.
result Reduces over-complexification and misalignment in strategic use selection.

Deep neural networks and decision trees operate on largely separate paradigms; typically, the former performs representation learning with pre-specified architectures, while the latter is characterised by learning hierarchies over pre-specified features with data-driven architectures. We unite the two via adaptive neur…

2018-07-17abs ↗pdf ↗

The paper predicts and explains the decay of stock anomaly performance over time.

problem Predicting and explaining the drop in risk-adjusted performance of stock anomalies.
method The authors propose ex-ante characteristics based on hypotheses of out-of-sample decay and in-sample overfitting.
result The year of publication explains 30% of the variance in Sharpe decay across factors.

A fuzzy expert system selects stocks for BSE using AI techniques.

problem Selecting stocks for investment allocation is challenging due to many influencing factors.
method Dempster-Shafer (DS) evidence theory for rule base generation, portfolio optimization model with ACO algorithm.
result The model's performance is satisfactory for short-term investment.

Study uses chatbot to understand users' needs for ML model explanations.

problem Lack of understanding of user needs for model explanations.
method Developed a conversational system (dr_ant) to collect user questions about a machine learning model trained on Titanic data.
result Collected a corpus of 1000+ dialogues to identify common user questions.

AGFN improves causal discovery by integrating expert feedback and handling latent confounding.

problem Inaccurate causal discovery due to unreliable expert knowledge and latent confounding.
method Ancestral GFlowNet (AGFN) is a reinforcement learning algorithm that iteratively refines a policy based on noisy expert feedback to infer ancestral graphs.
result AGFN converges to the true ancestral graph given accurate expert responses and outperforms baselines in structural Hamming distance and Bayesian Information Criterion.

The paper examines how risk reduction and insurance choices interact under convex premium principles.

problem Interaction between self-protection and insurance demand under convex premium principles.
method Investigates optimal prevention efforts and insurance shares using distortion risk measures.
result Self-protection and insurance are complementary, but ex ante moral hazard can turn this into a substitution effect.

Paper compares solutions of Poisson equations on Riemannian manifolds with Robin boundary.

problem Comparing solutions of Poisson equations on Riemannian manifolds with Robin boundary.
method Using Schwarz rearrangement and isoperimetric inequalities.
result Extends results on Poisson equations with Ric(n1)κRic\geq (n-1)κ.

This paper investigates the equilibrium interactions between trading targets and private information in a multi-period Kyle (1985) market. There are two investors who each follow dynamic trading strategies: A strategic portfolio rebalancer who engages in order splitting to reach a cumulative trading target and an uncon…

2015-02-07abs ↗pdf ↗

We propose the application of a high-speed maximum likelihood clustering algorithm to detect temporal financial market states, using correlation matrices estimated from intraday market microstructure features. We first determine the ex-ante intraday temporal cluster configurations to identify market states, and then st…

2015-08-20abs ↗pdf ↗

We introduce a natural generalization of the forward-starting options, first discussed by M. Rubinstein. The main feature of the contract presented here is that the strike-determination time is not fixed ex-ante, but allowed to be random, usually related to the occurrence of some event, either of financial nature or no…

2015-04-14abs ↗pdf ↗

Fair insurance contracts are designed to handle default risk using cooperative game theory.

problem Designing fair insurance contracts in the presence of default risk.
method Cooperative game theory to specify premiums and participation in benefit.
result Fair benefit participation emerges as a game outcome involving residual risks.

We show that, in a resource allocation problem, the ex ante aggregate utility of players with cumulative-prospect-theoretic preferences can be increased over deterministic allocations by implementing lotteries. We formulate an optimization problem, called the system problem, to find the optimal lottery allocation. The …

2018-12-03abs ↗pdf ↗

The study uses a multi-armed bandit model to analyze and mitigate hiring discrimination.

problem Hiring discrimination due to insufficient data on worker skill and characteristics.
method Multi-armed bandit model to simulate firms' learning process and policy solutions.
result Temporary affirmative actions effectively alleviate discrimination caused by data insufficiency.

Sparse reward is one of the biggest challenges in reinforcement learning (RL). In this paper, we propose a novel method called Generative Exploration and Exploitation (GENE) to overcome sparse reward. GENE automatically generates start states to encourage the agent to explore the environment and to exploit received rew…

2019-04-21abs ↗pdf ↗

Study shows SEC crypto classification led to significant market reactions.

problem Impact of SEC classification of crypto assets as securities.
method Event study methodology focusing on explicitly named crypto assets.
result Significant adverse market reactions, with returns plummeting 12% over one week.

Model-based reinforcement learning could enable sample-efficient learning by quickly acquiring rich knowledge about the world and using it to improve behaviour without additional data. Learned dynamics models can be directly used for planning actions but this has been challenging because of inaccuracies in the learned …

2019-10-12abs ↗pdf ↗

A new RL framework handles autocorrelated actions for better learning and stability.

problem Improving reinforcement learning algorithms for better stability and efficiency.
method Introduces a new algorithm that optimizes policies with autocorrelated actions.
result The new algorithm outperforms existing methods in four simulated control problems.