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

Trend · papers per month

23477093 · Jun 202019922001200920172026
48 results for guided evolution

New sampling method reduces variance in correlated high-dimensional distributions.

problem Reducing variance in Monte Carlo estimators for correlated high-dimensional distributions.
method DPPMC (Determinantal Point Processes Monte Carlo) method for structured sampling.
result DPPMCs improve state-of-the-art in various optimization and machine learning problems.

This paper uses bandit theory and Thompson Sampling to optimize protein sequences.

problem Optimizing protein sequences using machine learning and directed evolution.
method Proposes a Thompson Sampling-guided Directed Evolution (TS-DE) framework.
result TS-DE achieves a nearly optimal Bayesian regret of order ildeO(d2MT) ilde O(d^{2}\sqrt{MT}).

New approach uses Wasserstein distances to score and optimize policy behaviors.

problem Comparing reinforcement learning policies and guiding policy optimization.
method Dual formulation of Wasserstein distances in latent behavioral space, learning score functions, smoothed WDs, stochastic gradient descent, on-policy algorithms.
result Demonstrated improved performance over existing methods in various environments.

CausalEvolve improves efficiency and discovery in open-ended scientific tasks.

problem Lack of targeted guidance and knowledge organization in evolve-based agents.
method Causal scratchpad that identifies and reasons about guiding factors for evolution.
result Effective improvement in evolutionary efficiency and better solutions.

GH-PID uses guided harmonic paths for efficient SOT with interpretable diagnostics.

problem Efficiently solving Stochastic Optimal Transport with hard terminal distributions and soft costs.
method Guided Harmonic Path-Integral Diffusion (GH-PID) framework with low-dimensional guidance.
result GH-PID generates geometry-aware, cost-reducing trajectories that match terminal distributions.

SLED improves factuality in LLMs without external knowledge.

problem Unreliable or factually incorrect outputs from large language models.
method Contrasts final layer logits with early layers' logits, uses approximate gradient to refine outputs.
result Consistently improves factual accuracy over existing methods.

INFUSER improves reasoning by co-evolving a generator and solver with adaptive curriculum.

problem Improving reasoning in language models with minimal external supervision.
method INFUSER uses a Generator and Solver to co-evolve iteratively, rewarding the Generator with an influence score and the Solver with correctness rewards.
result INFUSER outperforms self-evolution baselines by over 20% on Olympiad and SuperGPQA benchmarks.

INFUSER improves reasoning by self-evolving with a generator and solver that co-learn from unstructured documents.

problem Improving reasoning through self-evolution
method INFUSER uses a generator and solver co-evolving in a document pool to improve reasoning.
result INFUSER outperforms strong self-evolution baselines on Olympiad and SuperGPQA benchmarks.

TPA-AD detects axle-box bearing anomalies using pseudo anomalies near normal boundaries.

problem Detecting axle-box bearing anomalies with only normal training data.
method Two-stage approach: pseudo anomalies, contrastive learning, KNN.
result Improves anomaly detection separability and sensitivity to degradation.

Macroscopic price evolution models are commonly used for investment strategies. There are first promising achievements in defining microscopic agent based models for the same purpose. Microscopic models allow a deeper understanding of mechanisms in the market than the purely phenomenological macroscopic models, and thu…

2011-03-28abs ↗pdf ↗

INTAGS uses interactive simulation to improve realism in multi-agent systems.

problem Challenges in developing realistic agent-based simulators for multi-agent systems.
method INTAGS introduces a novel metric to evaluate the difference between real and synthetic multi-agent systems, optimizing a stochastic policy in reinforcement learning to adapt to interactive sequential decision-making environments.
result INTAGS generates more realistic market data compared to state-of-the-art approaches.

Dynamic probabilistic forecasts guide optimal decisions in uncertain processes.

problem Optimal decision making in processes influenced by uncertain random factors.
method Stochastic models for probabilistic forecast evolution, calibrated from ensemble forecasts.
result Optimal decision strategies determined using dynamic probabilistic forecasts.

Neuro-Evolution is a field of study that has recently gained significantly increased traction in the deep learning community. It combines deep neural networks and evolutionary algorithms to improve and/or automate the construction of neural networks. Recent Neuro-Evolution approaches have shown promising results, rival…

2019-01-02abs ↗pdf ↗

Deep Reinforcement Learning (DRL) algorithms have been successfully applied to a range of challenging control tasks. However, these methods typically suffer from three core difficulties: temporal credit assignment with sparse rewards, lack of effective exploration, and brittle convergence properties that are extremely …

2018-05-21abs ↗pdf ↗

NPENAS improves neural architecture search efficiency and accuracy.

problem Efficient and accurate neural architecture search (NAS) for minimizing search costs.
method Proposes NPENAS, a neural predictor guided evolutionary algorithm that enhances exploration ability of evolutionary algorithms.
result NPENAS-BO and NPENAS-NP outperform existing NAS algorithms on NASBench-201, NASBench-101, and DARTS.

SDIFT generates full-field dynamics from sparse, irregular data.

problem Modeling and reconstructing physical dynamics from sparse, off-grid observations.
method SDIFT uses a functional Tucker model and sequential diffusion for generating full-field evolution from irregular sparse observations.
result Significant improvements in reconstruction accuracy and computational efficiency compared to state-of-the-art approaches.

NEAT algorithm optimizes stock trading with reduced risk.

problem Maximizing earnings while minimizing risk in stock trading.
method Applied NEAT algorithm to stock trading with multiple technical indicators, using progressive training data and a multi-objective fitness function.
result NEAT model achieved similar returns to Buy & Hold but with lower risk and stability.

The calculus correspondence has been known to exist between generic pedal evolutions and generic wave front evolutions. In this paper, we first extend the known results on the calculus correspondence to evolutions with multi-parameters, and then give applications of calculus correspondence. Moreover, we discuss the pos…

2012-06-25abs ↗pdf ↗

GUIDE-VAE generates user-guided data with improved realism and performance.

problem Generating data points for multi-user datasets while considering user information.
method Conditional generative model that integrates user embeddings and a pattern dictionary-based covariance composition.
result GUIDE-VAE outperforms conventional VAEs in multi-user settings, especially under data imbalance.

The paper studies circular evolutes and involutes of framed curves in Euclidean space.

problem Investigating properties of framed curves and their evolutes and involutes.
method Definition and analysis of circular evolutes and involutes of framed curves, properties of normal surfaces, and their relations.
result Circular evolutes and involutes of framed curves are opposite operations under suitable assumptions, similar to fronts in the Euclidean plane.

Dropout is often used in deep neural networks to prevent over-fitting. Conventionally, dropout training invokes \textit{random drop} of nodes from the hidden layers of a Neural Network. It is our hypothesis that a guided selection of nodes for intelligent dropout can lead to better generalization as compared to the tra…

2018-12-10abs ↗pdf ↗

The paper studies curve evolution using the PLR equation and its solutions.

problem Investigating the evolution of space curves governed by the PLR equation.
method Examined the Lund-Regge evolution and derived its representation in the Frenet frame, aligning with the Lax system of the PLR equation. Developed a construction method for curve families via the Sym formula.
result Described the Lund-Regge evolution corresponding to Date multi-soliton solutions to the PLR equation.

A new kernel framework analyzes spatio-temporal data from dynamic equations.

problem Analyzing spatio-temporal data from dynamic equations with noisy measurements.
method Kernel-based framework with representer theorem for minimizing error with given samples.
result Minimizes error in solutions of dynamic equations with noisy spatio-temporal data.

Study predicts evolution patterns for pretzel knots, revealing abrupt transitions and hidden non-linearity.

problem Predicting evolution of Khovanov polynomials for pretzel knots.
method Conjectured explicit evolution formulas, revealed abrupt transitions, and identified additional Lyapunov exponents.
result Abrupt transitions and hidden non-linearity in evolution of Khovanov polynomials for thick knots.

A new model learns demand patterns from data, reducing complexity and improving accuracy.

problem Forecasting short-term demand from spatiotemporal data with complex patterns.
method Temporal-Guided Network (TGNet) using graph networks and temporal-guided embedding.
result TGNet achieves competitive performance with fewer parameters compared to state-of-the-art models.

An axiomatic approach to signal reconstruction is formulated, involving a sample consistent set and a guiding set, describing desired reconstructions. New frame-less reconstruction methods are proposed, based on a novel concept of a reconstruction set, defined as a shortest pathway between the sample consistent set and…

2017-02-02abs ↗pdf ↗

Study the geometry and dynamics of skew evolutes and involutes, related to bicycle kinematics.

problem Understanding the geometry and dynamics of skew evolutes and involutes.
method Investigate the skew evolute and involute maps, comparing them to bicycle kinematics.
result The skew evolute and involute maps have properties analogous to bicycle kinematics.

The evolute of a smooth curve in an m-dimensional Euclidean space is the locus of centers of its osculating spheres, and the evolute of a spatial polygon is the polygon whose consecutive vertices are the centers of the spheres through the consecutive (m+1)-tuples of vertices of the original polygon. We study the iterat…

2016-11-27abs ↗pdf ↗

Paper characterizes optimal learning trajectories for high-dimensional nonlinear models.

problem Characterizing optimal learning trajectories in high-dimensional nonlinear models.
method Exploits maximum principle and dynamic programming for an optimal control problem of a gradient system.
result Constructs optimal learning trajectories leading to optimal model parameters.