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

Trend · papers per month

3367100133 · Oct 201919922001200920172026
48 results for Virtual Humans

VHGM-MAE generates synthetic humans from healthcare data.

problem Handling high-dimensional, sparse healthcare data with missing values.
method Masked autoencoder (MAE) tailored for healthcare data, addressing heterogeneity, missingness, and high-dimensionality.
result VHGM-MAE outperforms existing methods in missing value imputation and synthetic data generation.

Efficiently allocate budgets for LLM-assisted virtual screening to reduce costs.

problem Reducing the cost of evaluating alternatives in large-scale screening tasks.
method Propose a top-mm greedy evaluation mechanism and the EFG-mm algorithm for efficient budget allocation.
result Prove that EFG-mm is both sample-optimal and consistent in large-scale virtual screening.

Adversarial attacks aim to confound machine learning systems, while remaining virtually imperceptible to humans. Attacks on image classification systems are typically gauged in terms of pp-norm distortions in the pixel feature space. We perform a behavioral study, demonstrating that the pixel pp-norm for any $0\le p …

2019-06-06abs ↗pdf ↗

Training deep reinforcement learning agents complex behaviors in 3D virtual environments requires significant computational resources. This is especially true in environments with high degrees of aliasing, where many states share nearly identical visual features. Minecraft is an exemplar of such an environment. We hypo…

2019-08-02abs ↗pdf ↗

TraderTalk uses LLMs to simulate human trading interactions in financial markets.

problem Simulating realistic human trading interactions in financial markets.
method Hybrid ABM with LLM-generated behaviors for detailed conversations.
result Successfully replicates trade-to-order volume ratios in financial markets.

Subjective expected utility theory assumes that decision-makers possess unlimited computational resources to reason about their choices; however, virtually all decisions in everyday life are made under resource constraints - i.e. decision-makers are bounded in their rationality. Here we experimentally tested the predic…

2016-10-06abs ↗pdf ↗

RFC enhances humanoid control to imitate complex human motions.

problem Dynamics mismatch between humanoid models and real humans.
method Residual Force Control (RFC) augments control policies with external forces.
result RFC outperforms state-of-the-art methods in convergence speed and motion quality.

AI system analyzes financial analyst recommendations and track records for portfolio construction.

problem Human PMs rely on analyst recommendations and track records for portfolio decisions.
method Develops AI-based Recommender Systems to replicate analyst conviction and track records.
result AI can improve portfolio construction by integrating analyst conviction and track records.

Automated method creates compact chemical models from detailed ones, reducing complexity and improving accuracy.

problem Creating accurate low-dimensional chemical kinetic models from detailed ones is time-consuming and requires expert knowledge.
method Machine Learned Optimisation of Chemical Kinetics (MLOCK) algorithm systematically perturbs sub-models to find optimal compact models.
result Compact models (15 species) retain ~87% fidelity to detailed models, outperforming previous methods.

New RLHF approach mitigates bias in aligning LLMs with human preferences.

problem Algorithmic bias in RLHF leading to preference collapse.
method Preference Matching (PM) RLHF, using PM regularizer and conditional variant.
result 29% to 41% improvement in alignment with human preferences.

Refines virtual link equality criterion for diagrams with one virtual crossing.

problem Determining when a virtual link diagram represents a properly virtual link.
method Refines the Kauffman-Murasugi-Thislethwaite type inequality for virtual links.
result Criterion for virtual link diagrams with exactly one virtual crossing to represent a properly virtual link.

The virtual unknotting number of a virtual knot is the minimal number of crossing changes that makes the virtual knot to be the unknot, which is defined only for virtual knots virtually homotopic to the unknot. We focus on the virtual knot obtained from the standard (p,q)-torus knot diagram by replacing all crossings o…

2017-01-15abs ↗pdf ↗

This paper connects virtual biquandles to biquandles for virtual link colorings.

problem Extending invariants from biquandles to virtual biquandles.
method Establishing equivalence between two representations of virtual braid groups and introducing new labeling rules.
result The number of colorings of a virtual link by virtual biquandles can be recovered from colorings by biquandles.

We study the problem of designing AI agents that can robustly cooperate with people in human-machine partnerships. Our work is inspired by real-life scenarios in which an AI agent, e.g., a virtual assistant, has to cooperate with new users after its deployment. We model this problem via a parametric MDP framework where…

2019-10-05abs ↗pdf ↗

A new model for simulating cloth manipulation in robots, accurate to within 1cm.

problem Accurately simulating cloth manipulation in robots, especially in moderate stress environments.
method A continuous, isometric strain model for textiles, treating them as inextensible surfaces with only isometric motions. Aerodynamic effects are incorporated through virtual uncoupling of mass.
result Simulations are accurate to within 1cm compared to real-world manipulation, even with coarse meshes.

A virtual string can be defined as an equivalence class of planar diagrams under certain kinds of diagrammatic moves. Virtual strings are related to virtual knots in that a simple operation on a virtual knot diagram produces a diagram for a virtual string. In this paper we consider three operations on a virtual string …

2008-08-04abs ↗pdf ↗

A virtual nn-string is a chord diagram with nn core circles and a collection of arrows between core circles. We consider virtual nn-strings up to virtual homotopy, compositions of flat virtual Reidemeister moves on chord diagrams. Given a virtual 1-string αα, Turaev associated a based matrix that encodes invariants…

2017-09-02abs ↗pdf ↗

Given a virtual knot KK, we construct a group VGKVG_K called the virtual knot group, and we use the elementary ideals of VGKVG_K to define invariants of KK called the virtual Alexander invariants. For instance, associated to the k=0k=0 ideal is a polynomial HK(s,t,q)H_K(s,t,q) in three variables which we call the virtual Alexa…

2014-09-04abs ↗pdf ↗

A virtual link diagram is called normal if the associated abstract link diagram is checkerboard colorable, and a virtual link is normal if it has a normal diagram as a representative. Normal virtual links have some properties similar to classical links.In this paper, we introduce a method of converting a virtual link d…

2017-12-25abs ↗pdf ↗

Virtual singular braids are generalizations of singular braids and virtual braids. We define the virtual singular braid monoid via generators and relations, and prove Alexander- and Markov-type theorems for virtual singular links. We also show that the virtual singular braid monoid has another presentation with fewer g…

2015-04-05abs ↗pdf ↗

The aim of the present paper is to prove that the minimal number of virtual crossings for some families of virtual knots grows quadratically with respect to the minimal number of classical crossings. All previously known estimates for virtual crossing number were principally no more than linear in the number of classic…

2011-07-25abs ↗pdf ↗

Virtual knot theory, introduced by Kauffman, is a generalization of classical knot theory of interest because its finite-type invariant theory is potentially a topological interpretation of Etingof and Kazhdan's theory of quantization of Lie bi-algebras. Classical knots inject into virtual knots, and flat virtual knots…

2012-09-20abs ↗pdf ↗

A virtual link can be understood as a link in a trivial I-bundle over an orientable compact surface with genus. A twisted virtual link is a link in a trivial I-bundle over a not-necessarily orientable compact surface. A twisted virtual birack is an algebraic structure with axioms derived from the twisted virtual Reidem…

2011-05-27abs ↗pdf ↗

We introduce a theory of virtual Legendrian knots. A virtual Legendrian knot is a cooriented wavefront on an oriented surface up to Legendrian isotopy of its lift to the unit cotangent bundle and stabilization and destablization of the surface away from the wavefront. We show that the groups of Vassiliev invariants of …

2013-05-23abs ↗pdf ↗

The paper characterizes crystallographic groups derived from virtual braid and twin groups.

problem Characterizing crystallographic groups from virtual braid and twin groups.
method Analyzing quotients of virtual braid and twin groups by their commutator subgroups.
result The quotients of virtual braid and twin groups by their commutator subgroups are crystallographic groups.

We generalize unoriented handlebody-links to the twisted virtual case, obtaining Reidemeister moves for handlebody-links in ambient spaces of the form Σ×[0,1]Σ\times [0,1] for ΣΣ a compact closed 2-manifold up to stable equivalence. We introduce a related algebraic structure known as twisted virtual bikeigebras whose axiom…

2017-11-12abs ↗pdf ↗