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

68135203270 · Jun 202019922001200920172026
48 results for Plain Graphs

CoulGAT interprets GAT models by analyzing node interactions.

problem Understanding and interpreting the complex interactions within graph attention networks.
method Developed a CoulGAT framework to analyze and interpret GAT model layers and datasets.
result Extracted node-node and node-feature interactions to define a standard model for graph structure.

Proposes methods for local clustering in attributed graphs.

problem Finding a single cluster concentrated on a specific region in a graph.
method Introduces Graph Unimodality (GU) and Attribute Unimodality (AU) measures, and LOCLU algorithm to optimize Compactness score.
result Local cluster detected by LOCLU concentrates on the region of interest and exhibits unimodal data distribution.

Gibbs sampling is the de facto Markov chain Monte Carlo method used for inference and learning on large scale graphical models. For complicated factor graphs with lots of factors, the performance of Gibbs sampling can be limited by the computational cost of executing a single update step of the Markov chain. This cost …

2018-06-15abs ↗pdf ↗

In this letter, as a proof of concept, we propose a deep learning-based approach to attack the chaos-based image encryption algorithm in \cite{guan2005chaos}. The proposed method first projects the chaos-based encrypted images into the low-dimensional feature space, where essential information of plain images has been …

2019-07-29abs ↗pdf ↗

BWFlow improves graph generation by smoothly interpolating graph components.

problem Disjoint modeling of graph nodes and edges leads to irregular and non-smooth probability paths.
method Modeling graphs as MRFs and using optimal transport displacement for a smooth probability path.
result BWFlow achieves better training convergence and efficient sampling in graph generation.

Paper compares GCNs and MPNNs, finding GCNs are one step ahead of WL algorithm.

problem Comparing graph convolutional networks (GCNs) and message-passing neural networks (MPNNs).
method Casts GCNs and MPNNs as MPNNs, studies distinguishing power of different architectures.
result GCNs are one step ahead of the Weisfeiler-Lehman (WL) algorithm in distinguishing power.

Generates coherent storybooks from plain text using diffusion models.

problem Ensuring coherency in a sequence of images for storytelling applications.
method Combines pre-trained LLM and text-guided Latent Diffusion Model for zero-shot generation.
result Outperforms state-of-the-art image editing baselines in generating coherent storybooks.

We present the particle stochastic approximation EM (PSAEM) algorithm for learning of dynamical systems. The method builds on the EM algorithm, an iterative procedure for maximum likelihood inference in latent variable models. By combining stochastic approximation EM and particle Gibbs with ancestor sampling (PGAS), PS…

2018-06-25abs ↗pdf ↗

The paper examines conditions for Gromov-Hausdorff convergence of metric quotients and provides examples of conic-flat surfaces.

problem Conditions for Gromov-Hausdorff convergence of metric quotients.
method Analyzes sufficient conditions for Gromov-Hausdorff convergence of metric quotients of a metric space.
result Concrete examples of sequences of two-dimensional conic-flat spheres converging to spheres with singularities.

The crisis that affected financial markets in the last years leaded market practitioners to revise well known basic concepts like the ones of discount factors and forward rates. A single yield curve is not sufficient any longer to describe the market of interest rate products. On the other hand, using different yield c…

2010-06-24abs ↗pdf ↗

The vast majority of the neural network literature focuses on predicting point values for a given set of response variables, conditioned on a feature vector. In many cases we need to model the full joint conditional distribution over the response variables rather than simply making point predictions. In this paper, we …

2016-06-07abs ↗pdf ↗

Many transformations in deep learning architectures are sparsely connected. When such transformations cannot be designed by hand, they can be learned, even through plain backpropagation, for instance in attention mechanisms. However, during learning, such sparse structures are often represented in a dense form, as we d…

2018-10-22abs ↗pdf ↗

We consider a network scenario in which agents can evaluate each other according to a score graph that models some interactions. The goal is to design a distributed protocol, run by the agents, that allows them to learn their unknown state among a finite set of possible values. We propose a Bayesian framework in which …

2018-06-04abs ↗pdf ↗

Method interpolates option prices and volatilities without arbitrage.

problem Interpolating option prices and volatilities without arbitrage.
method Sparse modeling approach based on integral equations and SVD.
result Flexible and efficient framework for arbitrage-free interpolation.

The network Lasso is a recently proposed convex optimization method for machine learning from massive network structured datasets, i.e., big data over networks. It is a variant of the well-known least absolute shrinkage and selection operator (Lasso), which is underlying many methods in learning and signal processing i…

2017-09-03abs ↗pdf ↗

Graph-coupled causal Bayesian optimization transfers information across related interventions.

problem Optimizing expensive systems where interventions are costly and causal effects are confounded.
method Ties intervention effects together through shared causal parameters, improving estimation.
result Information-gain and regret bounds show improved performance with shared mechanisms.

In this paper, we give a numerical method for pricing long maturity, path dependent options by using the Markov property for each underlying asset. This enables us to approximate a path dependent option by using some kinds of plain vanillas. We give some examples whose underlying assets behave as some popular Levy proc…

2009-11-30abs ↗pdf ↗

FOCUS improves offline RL by incorporating causal structure into world-models.

problem Learning effective policies from historical data without interaction.
method FOCUS proposes a practical algorithm that learns and leverages causal structure in offline RL.
result FOCUS outperforms plain model-based offline RL algorithms and other causal model-based RL algorithms.

Descending phase retrieval algorithms show a phase transition with increasing sample complexity.

problem Theoretical limits of descending phase retrieval algorithms.
method Utilizing Random duality theory (RDT), the study develops a generic program to characterize algorithm performance.
result As sample complexity increases, the parametric manifold transitions from multi to single funneling points, leading to a phase transition in algorithm success.

New algorithm samples matrix rows proportional to their ℓ_p norm in a turnstile data stream.

problem Sampling rows of a dynamic matrix efficiently in a turnstile data stream.
method Develops a novel algorithm for sampling rows proportional to their ℓ_p norm in a turnstile data stream, returning sampled row indexes and approximated sampling probabilities.
result Achieves (1+ε)(1+\varepsilon) approximation for logistic regression in a turnstile data stream with polynomial sketch size.

We study --both in theory and practice-- the use of momentum motions in classic iterative hard thresholding (IHT) methods. By simply modifying plain IHT, we investigate its convergence behavior on convex optimization criteria with non-convex constraints, under standard assumptions. In diverse scenaria, we observe that …

2017-12-26abs ↗pdf ↗

Flow-based generative models (Dinh et al., 2014) are conceptually attractive due to tractability of the exact log-likelihood, tractability of exact latent-variable inference, and parallelizability of both training and synthesis. In this paper we propose Glow, a simple type of generative flow using an invertible 1x1 con…

2018-07-09abs ↗pdf ↗

Proves a theorem for normal distributions on manifolds with boundary.

problem Normal distributions on manifolds with boundary require a new approach to integration.
method Introduces neat integral manifolds with boundary and conditions for integrability.
result Conditions for integrability expressed in terms of adapted collars and integrability on interior and boundary.