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

83167250333 · Jun 202019922001200920172026
48 results for visual dynamics

Manifold learning techniques for dynamical systems and time series have shown their utility for a broad spectrum of applications in recent years. While these methods are effective at learning a low-dimensional representation, they are often insufficient for visualizing the global and local structure of the data. In thi…

2019-06-25abs ↗pdf ↗

ARS visualization improves t-SNE dynamics with tunable attraction and repulsion.

problem Improve data visualization techniques for complex data sets.
method ARS framework based on t-SNE dynamics with normalized interactions and tunable kernels.
result ARS visualization provides better control over cluster tightness and spacing.

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.

GraphShield uses dynamic graph learning to detect and visualize financial risks.

problem Detecting and mitigating risks in financial networks.
method Enhanced Cross-Domain Information Learning, Advanced Risk Recognition, Risk Propagation Visualization.
result GraphShield effectively identifies and visualizes hidden financial risks.

Neural model predicts object states and physical parameters from visual observations.

problem Computational models struggle with physical reasoning and adapting to new environments.
method Visual prior predicts particle-based system from visual observations; inference module refines estimates subject to dynamics constraints.
result Model can infer physical properties within a few observations and adapt to unseen scenarios.

Understanding why and how certain neural networks outperform others is key to guiding future development of network architectures and optimization methods. To this end, we introduce a novel visualization algorithm that reveals the internal geometry of such networks: Multislice PHATE (M-PHATE), the first method designed…

2019-08-07abs ↗pdf ↗

This paper proposes a web-based visual graph analytics platform for interactive graph mining, visualization, and real-time exploration of networks. GraphVis is fast, intuitive, and flexible, combining interactive visualizations with analytic techniques to reveal important patterns and insights for sense making, reasoni…

2015-02-02abs ↗pdf ↗

Neural production systems learn visual dynamics by applying rule templates to entities.

problem Modeling interactions among entities in structured visual environments.
method Inspired by production systems, the paper uses rule templates to bind placeholder variables to specific entities, scoring and applying the best fitting rules to update entity properties.
result The architecture achieves robust future-state prediction and extrapolation from simple to complex environments, outperforming GNNs.

Object-based approaches for learning action-conditioned dynamics has demonstrated promise for generalization and interpretability. However, existing approaches suffer from structural limitations and optimization difficulties for common environments with multiple dynamic objects. In this paper, we present a novel self-s…

2019-04-16abs ↗pdf ↗

We present an approach for reconfiguration of dynamic visual sensor networks with deep reinforcement learning (RL). Our RL agent uses a modified asynchronous advantage actor-critic framework and the recently proposed Relational Network module at the foundation of its network architecture. To address the issue of sample…

2018-08-13abs ↗pdf ↗

Paper establishes baselines for offline RL from visual observations.

problem Challenges in offline reinforcement learning from visual observations with continuous action spaces.
method Simple baselines and benchmarking tasks for offline RL from visual observations.
result Simple modifications to existing online RL algorithms outperform existing offline RL methods.

The paper proposes a framework to reason about object dynamics for faster reinforcement learning.

problem Current reinforcement learning approaches lack prior knowledge about the environment, limiting efficiency.
method Integrates object dynamics and behavior into reinforcement learning to improve efficiency.
result Demonstrates the need for reasoning about object behavior and dynamics, leading to faster learning.

Study finds physical priors don't significantly improve ML models for learning latent dynamics.

problem Learning latent dynamics from visual observations without access to the underlying state.
method Benchmarked 17 datasets with visual observations of physical systems using various physically inspired methods alongside baselines.
result Physical priors do not significantly improve standard techniques for learning latent dynamics.

Deep Reinforcement Learning (DRL) is a trending field of research, showing great promise in many challenging problems such as playing Atari, solving Go and controlling robots. While DRL agents perform well in practice we are still missing the tools to analayze their performance and visualize the temporal abstractions t…

2016-06-22abs ↗pdf ↗

Inner product-based convolution has been the founding stone of convolutional neural networks (CNNs), enabling end-to-end learning of visual representation. By generalizing inner product with a bilinear matrix, we propose the neural similarity which serves as a learnable parametric similarity measure for CNNs. Neural si…

2019-10-28abs ↗pdf ↗

Diestel-Leader graphs are neither hyperbolic nor CAT(0), so their visual boundaries may be pathological. Indeed, we show that for d>2d>2, DLd(q)\partial\text{DL}_d(q) carries the indiscrete topology. On the other hand, DL2(q)\partial\text{DL}_2(q), while not Hausdorff, is T1T_1, totally disconnected, and compact. Since $\text{D…

2013-07-08abs ↗pdf ↗

We introduce simple cost and risk proxy metrics that can be attached to Treasury issuance strategy to complement analysis of the resulting portfolio weighted-average maturity (WAM). These metrics are based on mapping issuance fractions to their long-term, asymptotic portfolio implications for cost and risk under mechan…

2018-02-09abs ↗pdf ↗

Study visualizes actor-critic loss landscapes for inventory optimization.

problem Difficulties in solving multi-store dynamic inventory control problems.
method Low-dimensional visualizations of actor loss function.
result Loss landscapes favor optimal policies in reinforcement learning.

TimeTrail detects financial fraud patterns through temporal correlation analysis.

problem Detecting and explaining complex financial fraud patterns.
method Temporal data enrichment, dynamic correlation analysis, interpretable pattern visualization.
result TimeTrail outperforms conventional methods in accuracy and interpretability.

CVRL tackles complex visual observations in reinforcement learning.

problem Complex visual observations in natural environments.
method Contrastive Variational Reinforcement Learning (CVRL) learns a contrastive variational model by maximizing mutual information between latent states and observations.
result CVRL achieves comparable performance with state-of-the-art model-based DRL methods and significantly outperforms them on tasks with complex observations.

New method improves RL/IL agents' adaptability to unseen environments.

problem Current RL/IL techniques struggle with generalizing to unseen environments.
method Zero-shot compositional policy learning with multi-modal fusion and attention mechanism.
result Language grounding enhances generalization across varied environments.

Curriculum learning speeds up agent learning in Minecraft, a complex visual domain.

problem Training agents to learn multiple tasks in a complex, visual domain.
method Learning-progress based curriculum and dynamic exploration bonuses.
result Curriculum learning improves agent performance in a complex reinforcement learning problem.

Requirements elicitation can be very challenging in projects that require deep domain knowledge about the system at hand. As analysts have the full control over the elicitation process, their lack of knowledge about the system under study inhibits them from asking related questions and reduces the accuracy of requireme…

2018-07-10abs ↗pdf ↗

Learning network representations is a fundamental task for many graph applications such as link prediction, node classification, graph clustering, and graph visualization. Many real-world networks are interpreted as dynamic networks and evolve over time. Most existing graph embedding algorithms were developed for stati…

2019-10-04abs ↗pdf ↗

Explains a 2D color exchange invariant correspondence to 3D linking numbers.

problem Understanding color exchange invariants in 2D dynamics and their 3D geometric interpretation.
method Visualizes invariants as linking of lines on a special surface with Arf-Kervaire invariant one, and interprets it as an obstruction to continuous transformation.
result Interprets a 2D color exchange invariant as a 3D linking number, providing a topological explanation.

Automating the customer analytics process is crucial for companies that manage distinct customer bases. In such data-rich and dynamic environments, visualization plays a key role in understanding events of interest. These ideas have led to the popularity of analytics dashboards, yet academic research has paid scant att…

2015-11-17abs ↗pdf ↗

Learning latent representations of nodes in graphs is an important and ubiquitous task with widespread applications such as link prediction, node classification, and graph visualization. Previous methods on graph representation learning mainly focus on static graphs, however, many real-world graphs are dynamic and evol…

2018-12-22abs ↗pdf ↗

Alternative sampling method for autoregressive models using Langevin dynamics.

problem Efficiently sampling from autoregressive models.
method Initialize sequences with white noise and follow Langevin dynamics on global log-likelihood.
result Parallelizes and generalizes sampling process for autoregressive models.