Meta-graph is currently the most powerful tool for similarity search on heterogeneous information networks,where a meta-graph is a composition of meta-paths that captures the complex structural information. However, current relevance computing based on meta-graph only considers the complex structural information, but i…
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
48 results for “path information”
Introduces a neural network-based method for efficient state and parameter estimation in complex systems.
problem Efficiently estimating state paths and parameters from noisy measurements in high-dimensional nonlinear systems.
method Bayesian Information Field Theory with neural network parameterization and optimization algorithms.
result Proposes a method to simplify and enrich state path parameterizations using neural networks, improving inference accuracy.
Tensor-based method simplifies causal skeleton discovery.
problem Discover causal relationships between variables.
method Express associations as tensors to reduce dimensionality.
result Causal skeleton can be determined using pair-wise tensors.
Proposes HetSANN for learning heterogeneous graph structures without meta-paths.
problem Learning low-dimensional vector space of heterogeneous information networks.
method Implicitly represents heterogeneous information through entity space transformation and attention mechanism.
result Significant improvements over state-of-the-art solutions on public datasets.
An efficient search-and-score algorithm for ancestral graphs using multivariate information scorescs.LG
Efficiently searches ancestral graphs using multivariate information.
problem Discovering causal relationships in graphs with latent variables.
method Greedy search-and-score algorithm with two-step approach.
result Outperforms existing methods on benchmark datasets.
Geodesics connect model modes in neural network loss landscapes.
problem Connecting modes in neural network loss landscapes.
method Reframed mode connectivity in Information Geometry, hypothesized geodesics as mode-connecting paths, proposed algorithm to approximate geodesics.
result Geodesics achieve mode connectivity in neural networks.
A Bayesian framework models dynamic probability predictions over time.
problem Dynamic probability predictions over time in various settings.
method Gaussian latent information martingale (GLIM) framework.
result GLIM outperforms baseline methods in predicting future uncertainties.
Study examines how information flows in Indian stock market during crises.
problem Understanding information diffusion in financial networks during market turbulence.
method Applied communicability, a measure of ease of information flow, to financial networks.
result Approximately 70% and 80% of stock pairs exhibit significant changes in communicability during crises.
User-based attribute information, such as age and gender, is usually considered as user privacy information. It is difficult for enterprises to obtain user-based privacy attribute information. However, user-based privacy attribute information has a wide range of applications in personalized services, user behavior anal…
Paper proposes a method to evaluate SME credit risk using meta paths.
problem Evaluate credit risk of small and medium-sized enterprises with limited data.
method Exploits the representative power of information networks and meta paths to infer SME financial status.
result Meta path feature effectively identifies SMEs with credit risks.
Solar: solution path averaging for fast and accurate variable selection in high-dimensional datastat.ML
Solar algorithm selects variables faster and more accurately in high-dimensional data.
problem Variable selection in high-dimensional data with high accuracy and stability.
method Subsample-ordered least-angle regression (solar) and its coordinate descent generalization (solar-cd) using norm solution path averaging.
result Solar selects variables with high accuracy and stability, reducing redundant variable selection.
We consider the problem of path inference: given a path prefix, i.e., a partially observed sequence of nodes in a graph, we want to predict which nodes are in the missing suffix. In particular, we focus on natural paths occurring as a by-product of the interaction of an agent with a network---a driver on the transporta…
End-to-end KBQA system learns from multiple reasoning paths without labeled paths.
problem Lack of labeled reasoning paths limits KBQA system performance.
method End-to-end KBQA system using multiple reasoning paths.
result Demonstrates strong performance on various KBQA datasets.
A new method extracts events and their arguments efficiently from text.
problem Efficiently extract event information from texts with long-range dependencies and associations.
method Graph Convolutional Networks with shortest dependency paths to capture syntactic relationships.
result Significant improvement over state-of-the-art methods.
Heterogeneous Information Network based Default Analysis on Banking Micro and Small Enterprise Usersq-fin.RM
Paper proposes HIDAM model to improve MSE default risk assessment using heterogeneous information networks.
problem Default risk assessment for MSEs due to lack of credit information and diverse financial activities.
method HIDAM model incorporating heterogeneous information networks with multi-typed nodes and links, extracting interactive information through meta-paths, and using a hierarchical attention mechanism.
result HIDAM model outperforms state-of-the-art competitors on real-world banking data.
New method identifies causal structure in count data using cumulants and path analysis.
problem Challenges in discovering causal structure from count data, especially due to non-identifiability.
method Poisson Branching Structural Causal Model (PB-SCM) with path analysis using high-order cumulants.
result Causal order is identifiable under specific conditions in PB-SCM using cumulant information.
Transformer model improves asset allocation by unifying forecasting and optimization.
problem Separation of forecasting and optimization leads to suboptimal portfolios.
method Signature Informed Transformer using path signatures and specialized attention.
result Direct minimization of Conditional Value at Risk improves performance.
Neural network learns from higher-order connections in molecules.
problem Graph neural networks fail to account for local and hidden structures in graphs.
method Developed a neural network that can pass messages and aggregate information across higher-order paths.
result The model improves molecular property prediction.
We study the problem of online path learning with non-additive gains, which is a central problem appearing in several applications, including ensemble structured prediction. We present new online algorithms for path learning with non-additive count-based gains for the three settings of full information, semi-bandit and…
A new graph kernel uses LCS and Wasserstein distance for better graph comparisons.
problem Graph learning methods can be limited by information from distant vertices and path length constraints.
method Proposes a Graph Kernel based on LCS similarity and Wasserstein distance in a novel metric space.
result The new kernel emphasizes comparisons between similar paths and reduces information loss.
We use Karhunen-Loève expansion for efficient pricing of exotic derivatives.
problem Efficient pricing of path-dependent options.
method Karhunen-Loève expansion and Monte Carlo simulation.
result Fast and accurate computation of exotic derivatives pricing.
New BdryMatérn GP model for reliable boundary integration on irregular domains.
problem Incorporating boundary information in Gaussian process models for complex phenomena.
method Proposes a novel BdryMatérn GP framework with a new covariance kernel derived via path integral and stochastic PDE.
result Sample paths from the BdryMatérn GP satisfy desired boundaries with smoothness control on derivatives.
Improved RL for knowledge graph reasoning with entity types.
problem Challenges in path-based relational reasoning over knowledge graphs.
method Type-enhanced RL agent using GNN for neighborhood information.
result Outperforms state-of-the-art RL methods and discovers novel paths.
Paper develops approximation and statistical theory for signature-based path regression.
problem Understanding how fast signatures approximate continuous path functionals.
method Develops \(L^2\) approximation rate for smooth functionals of Itô diffusions and establishes consistency of statistical learning procedures.
result Signature-based methods improve prediction over handcrafted features in various real-data applications.
ie-HGCN addresses HIN challenges by efficiently learning node representations.
problem Lack of flexibility in exploring meta-paths and high computational complexity in HIN GCN methods.
method Hierarchical aggregation architecture that automatically extracts useful meta-paths and reduces computational cost.
result ie-HGCN outperforms state-of-the-art methods on real network datasets.
Conservation laws improve diffusion model training by optimizing likelihood.
problem Training diffusion models with denoising objectives.
method Developed conservation laws based on GEXIT functions for memoryless noise processes.
result Unified characterization of diffusion model likelihood, reducing training to learning marginal posteriors.
New analysis of annealing paths in sampling and estimation.
problem Sampling from complex distributions and estimating normalization constants.
method Extending known results on Bregman divergence to quasi-arithmetic means under monotonic embedding.
result Analogous result for quasi-arithmetic means, highlighting the interplay between means, parametric families, and divergence functionals.
Lazy, perfectly informed investors trade infrequently due to costs.
problem The paradox of an omniscient yet lazy investor trading infrequently.
method Formalized the paradox using geometric and fractional Brownian motion models, derived closed-form profit functions, and proved existence and uniqueness of the optimal trading frequency.
result The optimal trading frequency can be interpreted through the fractal dimension of the price path.
SGD generalization bounds derived from information theory.
problem Understanding generalization of SGD for non-convex functions.
method Combining information-theoretic bounds with perturbation analysis.
result Upper bounds on SGD's generalization error based on gradient variance and function smoothness.
Knowledge graph construction consists of two tasks: extracting information from external resources (knowledge population) and inferring missing information through a statistical analysis on the extracted information (knowledge completion). In many cases, insufficient external resources in the knowledge population hinde…
HeteSpaceyWalk: A Heterogeneous Spacey Random Walk for Heterogeneous Information Network Embeddingcs.LG
Heterogeneous information network (HIN) embedding has gained increasing interests recently. However, the current way of random-walk based HIN embedding methods have paid few attention to the higher-order Markov chain nature of meta-path guided random walks, especially to the stationarity issue. In this paper, we system…
Efficient Path Prediction for Semi-Supervised and Weakly Supervised Hierarchical Text Classificationcs.LG
Hierarchical text classification has many real-world applications. However, labeling a large number of documents is costly. In practice, we can use semi-supervised learning or weakly supervised learning (e.g., dataless classification) to reduce the labeling cost. In this paper, we propose a path cost-sensitive learning…
Collective classification has been intensively studied due to its impact in many important applications, such as web mining, bioinformatics and citation analysis. Collective classification approaches exploit the dependencies of a group of linked objects whose class labels are correlated and need to be predicted simulta…
Unified approach to DP problems using Gumbel distribution and variational Bayesian inference.
problem Solving classical optimal path problems in a probabilistic framework.
method Gumbel distribution and variational Bayesian inference for latent optimal paths.
result Unified approach transforms DP problems into directed acyclic graphs with Gibbs distribution.
Quantum connections replace metrics with operator inner products.
problem Quantifying geometric properties in quantum systems.
method Defining quantum connections and duals using operator fields and inner products.
result Holonomy and dual connections are equivalent in quantum geometry.
In this paper, we study the problem of author identification under double-blind review setting, which is to identify potential authors given information of an anonymized paper. Different from existing approaches that rely heavily on feature engineering, we propose to use network embedding approach to address the proble…
In this paper, we describe the "implicit autoencoder" (IAE), a generative autoencoder in which both the generative path and the recognition path are parametrized by implicit distributions. We use two generative adversarial networks to define the reconstruction and the regularization cost functions of the implicit autoe…
We introduce a variant of (sparse) PCA in which the set of feasible support sets is determined by a graph. In particular, we consider the following setting: given a directed acyclic graph on vertices corresponding to variables, the non-zero entries of the extracted principal component must coincide with vertice…
The study identifies volatility models from path geometry using signature-based methods.
problem Identifying different stochastic volatility models from observed data.
method Mapping volatility trajectories into a feature space via truncated path signatures and applying a gradient boosting classifier.
result The method achieves high classification accuracy across various volatility dynamics and parameter settings.
Predicts next actions in soccer possessions using path signatures.
problem Predicting next actions in soccer possessions with high accuracy.
method Leveraging path signatures to encode spatio-temporal structure of recent possessions, avoiding manual feature engineering.
result Our approach outperforms transformer-based benchmarks across various loss metrics and reduces computational cost.
There are many real-world knowledge based networked systems with multi-type interacting entities that can be regarded as heterogeneous networks including human connections and biological evolutions. One of the main issues in such networks is to predict information diffusion such as shape, growth and size of social even…
The paper analyzes the role of ReLU gates in deep learning networks.
problem Understanding the role of gates in deep learning networks.
method Developed neural path features (NPF) and neural path values (NPV) to characterize the active sub-networks during training.
result The neural path kernel associated with NPFs is a fundamental quantity that characterizes the information stored in the gates of a DNN.
Matching datasets of multiple modalities has become an important task in data analysis. Existing methods often rely on the embedding and transformation of each single modality without utilizing any correspondence information, which often results in sub-optimal matching performance. In this paper, we propose a nonlinear…
Deep neural RDEs improve portfolio optimization accuracy and risk sensitivity.
problem High-dimensional, path-dependent valuation and control problems.
method Coupling truncated log-signatures with a neural RDE backbone.
result Improved accuracy, tail fidelity, and training stability across various financial models.
We study adaptive regret bounds in terms of the variation of the losses (the so-called path-length bounds) for both multi-armed bandit and more generally linear bandit. We first show that the seemingly suboptimal path-length bound of (Wei and Luo, 2018) is in fact not improvable for adaptive adversary. Despite this neg…
The paper confirms a conjecture about optimal expected utility in markets with insider information.
problem Optimal expected utility in markets with insider information.
method An extension of the Black-Scholes-Merton model with a sequence of discrete-time economies.
result Optimal expected utility converges to the classic model when conditions are met.
Estimating the travel time for a given path is a fundamental problem in many urban transportation systems. However, prior works fail to well capture moving behaviors embedded in paths and thus do not estimate the travel time accurately. To fill in this gap, in this work, we propose a novel neural network framework, nam…
Certain natural geometric approximation schemes are developed for Wiener measure on a compact Riemannian manifold. These approximations closely mimic the informal path integral formulas used in the physics literature for representing the heat semi-group on Riemannian manifolds. The path space is approximated by finite …