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

3978116155 · Jun 202019922001200920172026
48 results for mode interactions

Graph neural network predicts vehicle interactions and trajectories for autonomous driving.

problem Predicting future motion of vehicles in traffic scenes.
method Graph neural network that jointly predicts interaction modes and 5-second future trajectories.
result Jointly predicting trajectories and interaction modes leads to lower trajectory error.

New method decomposes KL error using refined information and mode interactions.

problem Learning probability distributions over discrete variables with higher-order interactions.
method Using information geometry, refined mode interactions, and a novel Monte-Carlo sampling technique.
result Complete decomposition of KL error and efficient data use.

With the network methods and random matrix theory, we investigate the interaction structure of communities in financial markets. In particular, based on the random matrix decomposition, we clarify that the local interactions between the business sectors (subsectors) are mainly contained in the sector mode. In the secto…

2014-05-31abs ↗pdf ↗

A user-friendly interface constructs effective background knowledge from ER diagrams.

problem Inefficient construction of background knowledge by domain experts in ILP systems.
method Design of a graphical user interface to interact with Entity Relationship diagrams to construct modes for a probabilistic logic learning system.
result Domain experts can construct effective background knowledge on par with experts using the graphical interface.

A new method for decomposing non-negative tensors using energy-based modeling.

problem Challenges in traditional tensor decomposition methods, especially global optimization and rank selection.
method Energy-based modeling of tensors, considering interactions between modes for global optimization.
result Demonstrates effectiveness in tensor completion and approximation, revealing a relationship between many-body and low-rank approximations.

We study two procedures (reverse-mode and forward-mode) for computing the gradient of the validation error with respect to the hyperparameters of any iterative learning algorithm such as stochastic gradient descent. These procedures mirror two methods of computing gradients for recurrent neural networks and have differ…

2017-03-06abs ↗pdf ↗

We analyze the statistics of daily price change of stock market in the framework of a statistical physics model for the collective fluctuation of stock portfolio. In this model the time series of price changes are coded into the sequences of up and down spins, and the Hamiltonian of the system is expressed by spin-spin…

2001-10-06abs ↗pdf ↗

To investigate the universality of the structure of interactions in different markets, we analyze the cross-correlation matrix C of stock price fluctuations in the National Stock Exchange (NSE) of India. We find that this emerging market exhibits strong correlations in the movement of stock prices compared to developed…

2007-04-05abs ↗pdf ↗

We quantify forgetting in post-training models, distinguishing mass and drift.

problem Understanding and preventing forgetting in post-training generative models.
method Developed theoretical results under a two-mode mixture abstraction, formalizing mass and drift forgetting.
result Forgetting can be precisely quantified based on divergence direction, geometric overlap, and training regime.

Deep learning model predicts protein-ligand binding modes from docking data.

problem Improving protein-ligand binding mode prediction accuracy.
method Dual-graph architecture with separate sub-networks for ligand topology and protein-ligand interactions.
result Deep learning model outperforms docking programs in binding mode prediction.

In order to use the advanced inference techniques available for Ising models, we transform complex data (real vectors) into binary strings, by local averaging and thresholding. This transformation introduces parameters, which must be varied to characterize the behaviour of the system. The approach is illustrated on fin…

2013-11-15abs ↗pdf ↗

A neural network and evolutionary algorithm framework designs nonlinear optical molecules.

problem Designing efficient nonlinear optical materials.
method Multi-stage Bayesian neural network (msBNN) and corrected Lewis-mode group contribution method (cLGC) combined with evolutionary algorithm (EA).
result Accurately and efficiently designs molecules with different optical properties using a small data set.

The vast majority of current machine learning algorithms are designed to predict single responses or a vector of responses, yet many types of response are more naturally organized as matrices or higher-order tensor objects where characteristics are shared across modes. We present a new machine learning algorithm BaTFLE…

2016-12-09abs ↗pdf ↗

Survey of GANs and autoencoders, addressing mode collapse and likelihood issues.

problem Addressing mode collapse and likelihood issues in GANs and autoencoders.
method Explains various GAN and autoencoder variants, their applications, and methods to resolve issues.
result Various methods to resolve mode collapse and improve likelihood in GANs and autoencoders.

Paper proposes a new method for predicting drug interactions using adversarial autoencoders.

problem Predicting drug interactions to prevent adverse events.
method Introduces adversarial autoencoders based on Wasserstein distances and Gumbel-Softmax relaxation to generate high-quality negative samples.
result Significant improvements in link prediction and DDI classification tasks.

Study analyzes bias interactions in multimodal models using simulation-based methods.

problem Analyzing dynamic bias interactions in multimodal models to ensure fairness and equity.
method Simulation-based heuristic approach to compute bias scores for text-only, image-only, and multimodal embeddings.
result Multimodal bias interactions can be amplification, mitigation, or neutral, with text bias often dominant.

Finsler geometry connects to higher-spin fields and curved-space Fronsdal equations.

problem Eliminating non-transverse modes in Finsler dynamics for higher spins.
method Parameterizing Finsler geometry in terms of symmetric tensors, analyzing linear and nonlinear terms, and examining gauge transformations.
result Finsler dynamics leads to the curved-space Fronsdal equation for all spins, plus a Stueckelberg-like coupling.

New methods for Bayesian inference using mean shift particle systems.

problem Approximating expectations with unnormalized densities in Bayesian inference.
method Mean shift interacting particle systems that minimize maximum mean discrepancy (MMD).
result Mean shift interacting particle systems converge quickly and capture complex distributions.

Transposable data represents interactions among two sets of entities, and are typically represented as a matrix containing the known interaction values. Additional side information may consist of feature vectors specific to entities corresponding to the rows and/or columns of such a matrix. Further information may also…

2014-04-27abs ↗pdf ↗

Framework uncovers symmetric and asymmetric species associations from data.

problem Retrieving bidirectional species associations from co-occurrence data.
method Machine learning framework modeling latent embeddings and joint generative model.
result Framework successfully recovers known symmetric and asymmetric associations.

Study chaotic dynamics in social stratification models leading to thermalization and turbulence.

problem Understanding social stratification dynamics through chaotic nonlinear systems.
method Modeling social network links with oscillators and energies, studying Hamiltonian evolution and nonlinear interactions.
result Chaotic dynamics leads to dynamical thermalization and Kolmogorov-Zakharov turbulence, with implications for wealth inequality.

Motivated by advantages of current-mode design, this brief contribution explores the implementation of weight matrices in neuromemristive systems via current-mode memristor crossbar circuits. After deriving theoretical results for the range and distribution of weights in the current-mode design, it is shown that any we…

2017-07-17abs ↗pdf ↗

We develop a theory of bid and ask price dynamics where the two prices form due to interaction of buy and sell orders. In this model the two prices are represented by eigenvalues of a 2x2 price operator corresponding to "bid" and "ask" eigenstates. Matrix elements of price operator fluctuate in time which results in ph…

2013-12-17abs ↗pdf ↗

The level set tree approach of Hartigan (1975) provides a probabilistically based and highly interpretable encoding of the clustering behavior of a dataset. By representing the hierarchy of data modes as a dendrogram of the level sets of a density estimator, this approach offers many advantages for exploratory analysis…

2013-07-30abs ↗pdf ↗

Mathematical analysis shows annealing prevents mode collapse in Gaussian mixtures.

problem Mode collapse in variational inference for multimodal distributions.
method Analyzed annealing strategies for Gaussian mixtures, derived formulas, and tested on neural networks.
result Appropriately chosen annealing schemes can robustly prevent mode collapse.

Parsimonious Dynamic Mode Decomposition selects sparse modes robustly.

problem Manual tuning of sparsity parameters in traditional DMD.
method Time-delay embedding and Orthogonal Matching Pursuit.
result Autonomously determines optimally sparse subset of modes.

A new, efficient kk-modes algorithm improves clustering of categorical data.

problem Clustering categorical data using existing methods like kk-means is inefficient.
method Developed a novel kk-modes algorithm called OTQT, which improves on existing methods.
result OTQT finds more accurate clusters per iteration and is faster overall.

Multimodal clustering is an unsupervised technique for mining interesting patterns in nn-adic binary relations or nn-mode networks. Among different types of such generalized patterns one can find biclusters and formal concepts (maximal bicliques) for 2-mode case, triclusters and triconcepts for 3-mode case, closed $n…

2017-02-27abs ↗pdf ↗