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

12.5%25.0%37.5%50.0% · May 199319922001200920172026
48 results for dynamic aspect assignment

This survey article discusses three aspects of knot colorings. Fox colorings are assignments of labels to arcs, Dehn colorings are assignments of labels to regions, and Alexander-Briggs colorings assign labels to vertices. The labels are found among the integers modulo n. The choice of n depends upon the knot. Each typ…

2013-01-23abs ↗pdf ↗

The paper develops methods to estimate optimal treatment sequences under policy constraints.

problem Estimating the best sequence of treatments over multiple stages for individuals.
method Empirical welfare maximization approach, solving treatment assignment sequentially or simultaneously.
result Established convergence rates and upper bounds for estimation methods.

Hybrid Deep Embedding for aspect-level explanations in recommendations.

problem Challenges in personalization, dynamic explanations, and aspect-level granularity in recommendation systems.
method Proposes Hybrid Deep Embedding (HDE) to learn dynamic embeddings for user and item preferences, and aspect-level quality vectors.
result Demonstrates improved recommending performance and dynamic aspect-level explanations.

COCOA improves credit assignment in reinforcement learning by measuring contributions to rewards.

problem Improving sample efficiency in reinforcement learning through better credit assignment methods.
method Counterfactual Contribution Analysis (COCOA) for precise credit assignment.
result COCOA achieves lower bias and variance compared to Hindsight Credit Assignment (HCA), improving reinforcement learning performance.

Study shows how transformers learn to combine simple tasks into complex ones.

problem Understanding how transformers learn to perform complex tasks not seen during training.
method Controlled setting involving variable assignment and modular addition; partitioned training data analysis.
result Small transformers can generalize to unseen combinations of variables and numbers.

Spectral clustering is a widely studied problem, yet its complexity is prohibitive for dynamic graphs of even modest size. We claim that it is possible to reuse information of past cluster assignments to expedite computation. Our approach builds on a recent idea of sidestepping the main bottleneck of spectral clusterin…

2017-06-12abs ↗pdf ↗

Study optimal treatment assignment policies under strategic agent responses.

problem Learning optimal treatment policies with strategic agents complicates estimation.
method Dynamic model with threshold convergence to mean-field equilibrium, consistent estimator for policy gradient.
result Threshold for treatment assignment converges to mean-field equilibrium threshold under large but finite number of agents.

We propose a novel concept of a Systemic Optimal Risk Transfer Equilibrium (SORTE), which is inspired by the Bühlmann's classical notion of an Equilibrium Risk Exchange. We provide sufficient general assumptions that guarantee existence, uniqueness, and Pareto optimality of such a SORTE. In both the Bühlmann and the SO…

2019-07-09abs ↗pdf ↗

Heegaard Floer theory is a kind of topological quantum field theory, assigning graded groups to closed, connected, oriented 3-manifolds and group homomorphisms to smooth, oriented 4-dimensional cobordisms. Bordered Heegaard Floer homology is an extension of Heegaard Floer homology to 3-manifolds with boundary, with ext…

2011-07-28abs ↗pdf ↗

Paper presents algorithm for optimal job selection with dynamic scoring.

problem Optimal job assignment in a sequential selection process with dynamic scores.
method Developed using dynamic programming, with extensions for partial and no-information cases.
result Algorithm allows for optimal job assignment with limited information.

GRADE models evolving graph dynamics by learning node and community representations.

problem Lack of tools to study temporal community dynamics in evolving graphs.
method GRADE is a probabilistic model that learns evolving node and community representations via a random walk prior and variational inference.
result GRADE outperforms baselines in dynamic link prediction and dynamic community detection.

Extends driving model to control agent behavior in simulations.

problem Simulate realistic driving behavior for autonomous systems.
method Introduces Control-ITRA method to influence agent behavior through waypoint assignment and target speed modulation.
result Demonstrates controllable, infraction-free trajectories while preserving realism.

Generative model for joint discrete distributions using randomized assignment flows.

problem Efficiently representing and sampling from complex joint distributions of discrete variables.
method Randomized assignment flows on the statistical submanifold of factorizing distributions.
result Our model can efficiently represent and sample from any target distribution and assess likelihood of unseen data points.

Improved averaging method for noisy observations converges strongly.

problem Noisy observations from random dynamical systems require stable estimates.
method Introduced pp-EMA, a modified exponential moving average with subharmonic weight decay.
result Stochastic convergence guarantees for pp-EMA under mild assumptions.

The paper studies invariant weighted Bergman metrics on domains.

problem Investigating invariant weighted Bergman metrics under biholomorphisms.
method Introducing invariant weight assignments, using Bergman's minimum integral method and domain version of Tian-Yau-Zelditch expansion.
result Uniform convergence of weighted Bergman kernels and metrics on uniform squeezing domains.

The paper explores how planning with models improves credit assignment in reinforcement learning.

problem Improving credit assignment in reinforcement learning.
method Investigates the use of forward and backward models for planning in reinforcement learning.
result Establishes the relative merits and limitations of forward and backward planning mechanisms.

Optimizing storage assignment is a central problem in warehousing. Past literature has shown the superiority of the Duration-of-Stay (DoS) method in assigning pallets, but the methodology requires perfect prior knowledge of DoS for each pallet, which is unknown and uncertain under realistic conditions. The dynamic natu…

2019-03-12abs ↗pdf ↗

New system assigns vehicles to routes for cost and energy efficiency.

problem Optimizing vehicle route assignment for cost and energy efficiency.
method Machine learning-based neural network algorithm to estimate energy consumption and provide real-time recommendations.
result Demonstrated efficient vehicle assignment for medium and heavy duty trucks.

RL enhances cloud autoscaling by learning optimal resource allocation.

problem Optimizing resource allocation in dynamic, uncertain cloud environments.
method Reinforcement Learning for dynamic, transparent, and adaptable resource management policies.
result RL enables transparent, dynamic, and adaptable resource management policies.

This is an almost self-contained monograph (containing some new results) on left-orderable groups which mostly rely on dynamical and probabilistic aspects, but also on geometric, combinatorial, analytic, and topological ones. This new version contains many improvements, corrections and updates, many of them suggested b…

2014-08-25abs ↗pdf ↗

The use of kinetic modelling based on partial differential equations for the dynamics of stock price formation in financial markets is briefly reviewed. The importance of behavioral aspects in market booms and crashes and the role of agents' heterogeneity in emerging power laws for price distributions is emphasized and…

2010-07-09abs ↗pdf ↗

A RL approach dynamically assigns and updates weights of ensemble models for better time series forecasting.

problem Static weight assignment for ensemble models fails to capture dynamic data changes.
method Reinforcement Learning (RL) to dynamically update weights of each model at different time instants.
result Dynamic weighted approach using RL learns weights better than static methods.

In an incomplete financial market, the axiomatic of Time Consistent Pricing Procedure (TCPP), recently introduced, is used to assign to any financial asset a dynamic limit order book, taking into account both the dynamics of basic assets and the limit order books for options. Kreps-Yan fundamental theorem is extended t…

2008-09-22abs ↗pdf ↗

This research note combines two methods that have recently improved the state of the art in language modeling: Transformers and dynamic evaluation. Transformers use stacked layers of self-attention that allow them to capture long range dependencies in sequential data. Dynamic evaluation fits models to the recent sequen…

2019-04-17abs ↗pdf ↗

A hybrid framework prices options using neural networks and VAE latent space.

problem Lack of explicit asset dynamics information in compressed volatility surfaces.
method Combining Weighted Monte Carlo with neural networks trained on VAE latent space.
result Effective pricing of vanilla and exotic options on idealized vol surface.

Dissipative SymODEN learns dynamics with dissipation and control from data.

problem Learning dynamics with dissipation and control from observed data.
method Dissipative SymODEN encodes port-Hamiltonian dynamics into a deep learning architecture.
result The learned model reveals key aspects of the system, such as inertia, dissipation, and potential energy.

PEAR dynamically reconfigures agent roles to prevent persistent biases in multi-agent debates.

problem Persistent positional biases and sensitivity to role assignments in fixed topologies.
method Dynamic reconfiguration of agent roles and sparse topologies based on evolving agent states.
result Significantly improves average accuracy over debate baselines across multiple reasoning benchmarks.

We propose a novel stacked generalization (stacking) method as a dynamic ensemble technique using a pool of heterogeneous classifiers for node label classification on networks. The proposed method assigns component models a set of functional coefficients, which can vary smoothly with certain topological features of a n…

2016-10-16abs ↗pdf ↗

We introduce a prototype model in an attempt to capture some aspects of market dynamics simulating a trading mechanism. The model description starts with a discrete-space, continuous-time Markov process describing arrival and movement of orders with different prices. We then perform a re-scaling procedure leading to a …

2012-01-22abs ↗pdf ↗

In preference-based reinforcement learning (RL), an agent interacts with the environment while receiving preferences instead of absolute feedback. While there is increasing research activity in preference-based RL, the design of formal frameworks that admit tractable theoretical analysis remains an open challenge. Buil…

2019-08-04abs ↗pdf ↗