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

Trend · papers per month

72144216288 · Jun 202019922001200920172026
48 results for Graph Manipulation

Graph neural networks are vulnerable to adversarial attacks by manipulating graph structure.

problem Vulnerability of Graph Neural Networks to adversarial attacks.
method Categorization and review of existing attacks and defenses.
result Developed a repository for empirical studies on graph adversarial attacks and defenses.

Proposes KStar Diffuser for kinematics-aware bimanual robotic manipulation.

problem Challenges in applying imitation learning to bimanual robotic tasks.
method Integrates physical robot structure into action prediction using a dynamic spatial-temporal graph and differentiable kinematics.
result Effective generation of kinematics-aware actions in both simulation and real-world environments.

A numerical expression in the form of an integral is given for the determinant of the scalar GJMS operator on an odd--dimensional sphere. Manipulation yields a curious sum formula for the logdet in terms of the logdets of the ordinary conformal Laplacian for other dimensions. A few graphs are drawn.

2013-09-11abs ↗pdf ↗

Knowledge graph embedding (KGE) is a technique for learning continuous embeddings for entities and relations in the knowledge graph.Due to its benefit to a variety of downstream tasks such as knowledge graph completion, question answering and recommendation, KGE has gained significant attention recently. Despite its ef…

2019-04-26abs ↗pdf ↗

Paper tackles multi-object reinforcement learning, improving skill extrapolation.

problem Learning robust manipulation tasks in multi-object settings.
method Introduces a linear relation network module to enhance skill generalization.
result Agents can extrapolate and generalize to any new object number, scaling linearly.

GNNs robustness in community detection is studied with various perturbations.

problem Understanding GNNs robustness in community detection tasks.
method Systematic computational evaluation of six GNN architectures on synthetic and real-world networks.
result Supervised GNNs achieve higher baseline accuracy, while DMoN shows stronger resilience to perturbations.

We apply belief propagation to a Bayesian bipartite graph composed of discrete independent hidden variables and discrete visible variables. The network is the Discrete counterpart of Independent Component Analysis (DICA) and it is manipulated in a factor graph form for inference and learning. A full set of simulations …

2015-05-26abs ↗pdf ↗

Random projections help in representing sparse graphs efficiently.

problem Efficiently representing sparse graphs of varying sizes and vertex sets.
method Random projection of adjacency matrices to retain graph functionality and properties.
result Random projections can accurately represent graphs of different sizes and vertex sets in the same space.

Weak supervision enables learning causal representations from unstructured data.

problem Learning high-level causal representations from unstructured data like images.
method Weakly supervised setting with paired samples before and after interventions. Implicit latent causal models using variational autoencoders.
result Models can reliably identify causal structure and disentangle causal variables.

Learning representation for graph classification turns a variable-size graph into a fixed-size vector (or matrix). Such a representation works nicely with algebraic manipulations. Here we introduce a simple method to augment an attributed graph with a virtual node that is bidirectionally connected to all existing nodes…

2017-08-14abs ↗pdf ↗

Generative networks have made it possible to generate meaningful signals such as images and texts from simple noise. Recently, generative methods based on GAN and VAE were developed for graphs and graph signals. However, the mathematical properties of these methods are unclear, and training good generative models is di…

2018-09-28abs ↗pdf ↗

Graph data augmentation improves GNN performance in node classification.

problem Improving generalizability of graph neural networks (GNNs) in semi-supervised node classification.
method Introduces GAug framework for graph data augmentation using neural edge predictors.
result GAug framework improves GNN-based node classification performance across various architectures and datasets.

Efficiently approximates eigenspaces for symmetric and general matrices.

problem Fast computation of eigenspaces for large matrices.
method Factor eigenspaces into fundamental components using transformations, solve minimization problems, and iteratively update.
result Improved computational efficiency for eigenspace approximation.

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.

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.

Adaptive IP approach optimizes intervention design for causal graph recovery.

problem Designing efficient interventions to recover causal relationships from data.
method Iterative integer programming approach for optimizing information gain.
result Adaptive IP approach achieves full causal graph recovery with fewer interventions.

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.

Augments graph node features to improve GNN performance.

problem Improving graph neural networks' performance on large-scale datasets.
method Iteratively augments node features with gradient-based adversarial perturbations.
result Boosts model performance in node classification, link prediction, and graph classification tasks.

In this work we propose a model that can manipulate individual visual attributes of objects in a real scene using examples of how respective attribute manipulations affect the output of a simulation. As an example, we train our model to manipulate the expression of a human face using nonphotorealistic 3D renders of a f…

2019-01-28abs ↗pdf ↗

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.

In an illiquid stock, traders can collude and place orders on a predetermined price and quantity at a fixed schedule. This is usually done to manipulate the price of the stock or to create artificial liquidity in the stock, which may mislead genuine investors. Here, the problem is to identify such group of colluding tr…

2015-09-22abs ↗pdf ↗

Graph clustering is a fundamental task which discovers communities or groups in networks. Recent studies have mostly focused on developing deep learning approaches to learn a compact graph embedding, upon which classic clustering methods like k-means or spectral clustering algorithms are applied. These two-step framewo…

2019-06-15abs ↗pdf ↗

Manipulating data, such as weighting data examples or augmenting with new instances, has been increasingly used to improve model training. Previous work has studied various rule- or learning-based approaches designed for specific types of data manipulation. In this work, we propose a new method that supports learning d…

2019-10-28abs ↗pdf ↗

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.

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.

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 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.

There exist natural generalizations of the real moduli space of Riemann spheres based on manipulations of Coxeter complexes. These novel spaces inherit a tiling by the graph-associahedra convex polytopes. We obtain explicit configuration space models for the classical infinite families of finite and affine Weyl groups …

2005-02-08abs ↗pdf ↗

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.

Manipulation is an important issue for both developed and emerging stock markets. For the study of manipulation, it is critical to analyze investor behavior in the stock market. In this paper, an analysis of the full transaction records of over a hundred stocks in a one-year period is conducted. For each stock, a tradi…

2011-10-11abs ↗pdf ↗

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.