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.

169,051 papers · 148 categories

Trend · papers per month

6131925 · Jun 201919922001200920182026
48 results for Rope manipulation

This work learns visual representations for deformable objects using contrastive estimation.

problem Challenges in learning plannable visual representations for deformable objects.
method Jointly optimizes visual representation and dynamics models using contrastive estimation.
result Substantial improvements in performance over standard model-based learning techniques.

A rope is a non-singular embedding of a closed interval into R^3, which sends the ends of the interval to some fixed points A and B such that |AB|=1. A rope is short if its length is less than 3. The main result of the paper is that the fundamental group of the space of short ropes is naturally isomorphic to the group …

1998-10-06abs ↗pdf ↗

What is the longest rope on the unit sphere? Intuition tells us that the answer to this packing problem depends on the rope's thickness. For a countably infinite number of prescribed thickness values we construct and classify all solution curves. The simplest ones are similar to the seamlines of a tennis ball, others e…

2010-05-25abs ↗pdf ↗

In this paper, we give a precise and workable definition of a quantum knot system, the states of which are called quantum knots. This definition can be viewed as a blueprint for the construction of an actual physical quantum system. Moreover, this definition of a quantum knot system is intended to represent the "quantu…

2008-05-03abs ↗pdf ↗

RoPE framework calibrates misspecified simulators for reliable inference.

problem Misspecification compromises reliability of simulation-based inference.
method Data-driven calibration using optimal transport and a small calibration set.
result RoPE framework improves inference accuracy and uncertainty calibration.

Bayesian model compares ML algorithms on various datasets.

problem Comparing multiple machine learning algorithms across multiple datasets.
method Bayesian Bradley-Terry model, defining regions of practical equivalence (ROPE).
result Allows nuanced statements and ROPE definitions for algorithm comparison.

Proposes a method to learn dynamic models for systems with variable number of objects.

problem Efficiently modeling systems with a variable number of objects.
method Uses graph neural networks and block-wise linear transition matrices to learn compositional Koopman operators.
result The method adapts to new environments and produces better control signals.

The current dominant paradigm for imitation learning relies on strong supervision of expert actions to learn both 'what' and 'how' to imitate. We pursue an alternative paradigm wherein an agent first explores the world without any expert supervision and then distills its experience into a goal-conditioned skill policy …

2018-04-23abs ↗pdf ↗

I review few conceptual steps in analytic description of topological interactions, which constitute the basis of a new interdisciplinary branch in mathematical physics, "Statistical Topology", emerged at the edge of topology and statistical physics of fluctuating non-phantom rope-like objects. This new branch is called…

2016-08-23abs ↗pdf ↗

Misspecification-Aware Simulation-Based Inference via Side-Channel Guidance

problem Simulation-based inference (SBI) of latent parameters is hindered by simulator misspecification.
method Misspecification-Aware Simulation-Based Inference (MA-SBI) turns side-channel text into a posterior correction.
result MA-SBI matches the oracle posterior across 10 seeds and two backbones.

What length of rope (of given diameter) is required to tie a particular knot? To answer this question, we define some new notions of thickness for a space curve, one based on Gromov's distortion, and another generalizing the thickness of Litherland, Simon et al. We prove a basic inequality between these thickness measu…

1997-02-04abs ↗pdf ↗

AI learns market manipulation through simulation, suggesting regulation.

problem Regulating AI to prevent market manipulation.
method Used a genetic algorithm in an artificial market simulation.
result AI discovered market manipulation as an optimal strategy.

Model manipulates facial expressions without affecting other attributes.

problem Manipulating specific visual attributes in real scenes without altering others.
method Trains model on nonphotorealistic 3D renders to manipulate facial expressions, preserving other attributes.
result Model can manipulate facial expressions without affecting other attributes like head orientation.

The paper analyzes how leverage affects manipulation in event-linked markets, offering new insights into regulation.

problem Manipulation and insider information in leveraged event-linked markets.
method Develops a two-axis manipulation taxonomy and analyzes leverage's effects on market-price and outcome manipulation.
result Leverage scales market-price manipulation linearly but shifts the cost-benefit threshold for outcome manipulation.

New model improves neural network robustness against input manipulations.

problem Improving neural network robustness against input manipulations.
method Causal view and deep causal manipulation augmented model (deep CAMA) with data augmentation and test-time fine-tuning.
result Deep CAMA shows superior robustness against unseen manipulations compared to traditional models.

This paper studies poisoning attacks in episodic RL and discovers their effectiveness depends on reward bounds.

problem Understanding security threats to RL algorithms through poisoning attacks.
method Examined two types of poisoning attacks: reward and action manipulation, in bounded and unbounded reward settings.
result The effectiveness of poisoning attacks depends on reward bounds, with different attack costs and success rates.

Donors who defer their donations volunteer less in the future.

problem Volunteer labor can be less beneficial to charities than its costs.
method Regression discontinuity design with a procedure to handle manipulation.
result Donor manipulation invalidates standard regression discontinuity design, but a new method provides partial identification bounds.

Prediction markets can be manipulated by traders who can move contract settlements, harming price discovery.

problem Manipulation of settlement times in prediction markets leads to unfair wealth transfer and harms price discovery.
method Developed a model showing how settlement manipulation transfers wealth and harms price discovery, and observed real-world effects on Polymarket's Bitcoin contract.
result Manipulators capture significant profits from retail traders, especially when settlement times are short.

New method uses statistical physics to detect financial market manipulation.

problem Detecting financial market manipulation activities like spoofing and layering.
method Modeling order book dynamics as particle motion and using momentum measure.
result Method outperforms conventional Z-score-based anomaly detection.

Manipulated explanations can be made imperceptible to the naked eye.

problem The trustworthiness and interpretability of neural networks can be compromised by manipulable explanations.
method The paper demonstrates that explanations can be altered by applying small, imperceptible input changes that do not affect the network's output.
result An upper bound on the susceptibility of explanations to manipulation has been derived, and effective mechanisms to enhance explanation robustness have been proposed.

Framework detects covert financial market manipulation using LOB representations.

problem Detecting covert financial market manipulation (spoofing) from complex anomaly patterns in multilevel prices.
method Cascaded contrastive representation learning of LOB data.
result Transformer-based architectures achieve state-of-the-art results in detection performance.

This paper detects market manipulation in Mt. Gox's Bitcoin exchange transactions.

problem Detecting market manipulation in cryptocurrency exchanges.
method Mining Mt. Gox's transaction history, categorizing accounts, constructing graphs, and using SVD for analysis.
result Identifies serious market manipulation in Mt. Gox exchange and recommends stronger market supervision.

Study reveals widespread manipulation of meme coins, leading to significant economic losses.

problem Widespread manipulation of meme coins leading to economic losses.
method Cross-chain analysis of 34,988 tokens across Ethereum, BNB Smart Chain, Solana, and Base.
result 82.8% of high-return tokens show evidence of artificial growth strategies.

A novel RL approach learns robotic manipulation without human demonstrations.

problem Learning robotic manipulation policies efficiently and effectively.
method Introducing simulated locomotion demonstration rewards (SLDRs) to enable RL learning.
result The approach achieves higher success rates and faster learning compared to alternatives.

A new method for robot manipulation tasks using imagined object goals.

problem Learning robot manipulation in sparse reward environments.
method Train objects to reach target positions, then use predictions to create a curriculum of tasks.
result Higher success rates in challenging learning scenarios compared to alternatives.

This work tackles force control for contact-rich manipulation tasks with rigid robots using RL.

problem Challenges in working with real robotic hardware, especially position-controlled robots.
method Combines RL with traditional force control techniques, implementing parallel position/force control and admittance control.
result Validated methods on both simulation and real robot (UR3 e-series) for force control.

Study on costs of manipulating AMM-based price oracles.

problem Cost of manipulation in AMM-based on-chain price oracles.
method Analyzes the robustness of AMM-based oracles to strategic manipulation, considering different aggregation methods and market conditions.
result Manipulation costs depend on the total quote depth and can be minimized by optimal liquidity weights.