HDT improves MCMC on graphs with history-dependent sampling.
problem Efficient sampling from target distributions on general graphs with low computational overhead.
method History-driven target (HDT) framework that replaces the original target distribution with a history-dependent one.
result Near-zero variance performance and scalability to large graphs with memory-efficient implementation.
Finite subdivision rules in high dimensions are shown to be equivalent to 3D rules.
problem Visualization and construction of high-dimensional subdivision rules.
method Characterized history graphs and defined combinatorial subdivision rules.
result Finite subdivision rules in arbitrary dimensions are combinatorially equivalent to 3D rules.
Graph change-point detection method learns graph similarity from data.
problem Detect abrupt changes in dynamic networks.
method Siamese graph neural network for graph similarity learning.
result Method detects changes in diverse types of networks with minimal data history.
Generative model connects random walk vertices to form networks, tractable for estimation and inference.
problem Modeling network formation with explicit dependence on graph structure.
method Generative model using random walks, maximum likelihood estimation, MCMC for history imputation.
result Model parameters can be recovered from a single graph generated by the model.
A new model learns demand patterns from data, reducing complexity and improving accuracy.
problem Forecasting short-term demand from spatiotemporal data with complex patterns.
method Temporal-Guided Network (TGNet) using graph networks and temporal-guided embedding.
result TGNet achieves competitive performance with fewer parameters compared to state-of-the-art models.
New algorithm improves graph inference tasks.
problem Complex graph reasoning and prediction tasks.
method Policy Message Passing algorithm reformulates graph inference as stochastic sequential processes.
result Consistently outperforms state-of-the-art models.
A framework combines multiple types of data for better item recommendations.
problem Limited performance of top-N recommendation systems using only one or two types of information.
method Design and implement GraFC2T2, a graph-based framework that encodes and combines content, temporal, and trust information.
result Combining different types of information improves recommendation performance.
Proposes a graph neural network for personalized news recommendation.
problem Data sparsity in news recommendation systems.
method Heterogeneous graph model + Graph Neural Networks + LSTM attention mechanism.
result Significantly outperforms state-of-the-art methods on news recommendation datasets.
New findings on hyperbolicity of fine curve graphs and their subgraphs.
problem Investigating hyperbolicity of fine curve graphs and their subgraphs.
method Analyzing large subgraphs of fine curve graphs and computing distances in specific cases.
result Large subgraphs of fine curve graphs contain flats of every finite dimension, indicating they are not hyperbolic.
This paper detects market manipulation in Mt. Gox's Bitcoin exchange transactions.
problem Detecting market manipulation in cryptocurrency exchanges.
method Mining Mt. Gox's transaction history, categorizing accounts, constructing graphs, and using SVD for analysis.
result Identifies serious market manipulation in Mt. Gox exchange and recommends stronger market supervision.
Survey of deep learning methods on graphs.
problem Applying deep learning to graph data is challenging.
method Divided into five categories: graph recurrent neural networks, graph convolutional networks, graph autoencoders, graph reinforcement learning, and graph adversarial methods.
result Comprehensive review of deep learning methods on graphs.
Topological anomaly scores predict return curves in S&P 500 stocks
problem Detecting anomalies in financial time series
method BallMapper, decoder-conditional VAE, Function-on-Function regression
result Anomaly history carries predictive content for return curves
Paper proves MDS NP-hard and provides a PTAS.
problem Theoretical limitations of MDS objective function.
method Proves NP-hardness and provides a PTAS approximation algorithm.
result Minimizing Kamada-Kawai objective is NP-hard.
Dynamical-VAE learns causal dynamics from POMDPs using future information.
problem Learning accurate state representations from partial observations in POMDPs.
method Dynamical Variational Auto-Encoder (DVAE) with hindsight framework.
result DVAE uncovers causal graph more effectively than history-based methods.
A new unsupervised method learns graph hierarchies using optimal transport.
problem Learning meaningful graph hierarchies without labeled data.
method Differentiable coarsening and optimal transport.
result OTCoarsening produces meaningful coarse graphs and competitive performance.
Bayesian inference over admissible histories leads to irreversible kinetics.
problem Modeling irreversible processes in systems with uncertain histories.
method A Gibbs-type measure weighted by energy-dissipation action and observation constraints, interpreted as a Bayesian posterior.
result The measure concentrates on maximum-a-posteriori (MAP) histories, recovering classical deterministic evolution.
The paper models crime risk using Foursquare check-ins and mobility data.
problem Understanding and predicting crime risk in urban areas.
method Directed graph of aggregated movement data, region risk factor derivation, DIFFER features.
result Reliable correlations between DIFFER features and crime count observed.
GAMENet uses graph memory networks to recommend safe medication combinations.
problem Lack of personalized and safe medication combination recommendations considering patient history and drug interactions.
method Integrates drug-drug interactions knowledge graph into a memory module using graph convolutional networks and models longitudinal patient records.
result GAMENet outperformed state-of-the-art methods in effectiveness and safety, reducing DDI rate by 3.60%.
Survey on deep models for graph generation.
problem Improving fidelity of generated graphs.
method Taxonomy and comparison of deep generative models.
result Advances in deep generative models for graph generation.
HS-FNO models non-Markovian PDEs by learning history and future states.
problem Non-Markovian dynamics where future states depend on past history.
method History-Space Fourier Neural Operator (HS-FNO) for delay and memory-driven PDEs.
result HS-FNO achieves lowest aggregate errors across various PDE families.
This study improves graph coarsening methods by preserving graph spectrum and distances.
problem Solving large-scale graph problems by working on a smaller graph.
method Developed a geometric approach using Gromov--Wasserstein distance to minimize the difference between graph distances and their coarsened versions.
result Minimizing the difference between graph distances and their coarsened versions can be achieved using the weighted kernel K K K -means method. Overview of affine surface area and its history.
problem None explicitly stated; focuses on overview.
method None explicitly stated; focuses on overview.
result None explicitly stated; focuses on overview.
Modeling Bitcoin risk using blockchain graph analysis.
problem Managing cryptocurrency FX risk for startups.
method High-fidelity blockchain graph representation for microstructure modeling.
result Identification of chainlets predicting Bitcoin price and volatility.
Survey of Baum-Connes conjecture history and methods.
problem Baum-Connes conjecture in mathematics.
method History and methods of the conjecture.
result Current status of the conjecture.
Survey on DDVV-type inequalities, their history, and recent developments.
problem None explicitly stated; focuses on surveying existing work.
method None explicitly stated; focuses on surveying existing work.
result Survey of DDVV-type inequalities and their history and recent developments.
Graphs evolve; GNNs learn from past tasks.
problem Learning from evolving graphs and new classes.
method Incremental training method for lifelong learning on graphs.
result Less than 50% of the GNN's receptive field is needed for 95% accuracy.
SRMC framework reduces Monte Carlo variance by history-based sampling in high-dimensional spaces.
problem Efficient sampling in high-dimensional discrete or continuous state spaces.
method Score-Repellent Monte Carlo (SRMC) framework that summarizes history through running average of score evaluations.
result Improves estimator variance and mode coverage with constant memory usage.
GTEA learns node representations in temporal interaction graphs.
problem Inductive representation learning on temporal interaction graphs.
method Integrates sequence model with time encoder and self-attention scheme for edge and node embeddings.
result GTEA learns comprehensive node representations capturing temporal and structural characteristics.
Paper analyzes history-based RL methods for MDPs, introduces a theoretical framework and practical algorithm.
problem Improving RL performance in MDPs using history-based features.
method Theoretical framework for history-based RL, practical algorithm design.
result Practical RL algorithm shows effectiveness on continuous control tasks.
A novel method uses blockchain transaction graphs for Bitcoin price prediction.
problem Insufficient effectiveness of manually designed features for Bitcoin price prediction.
method Mining patterns from Bitcoin transactions using k-order transaction graphs and proposing a novel prediction method.
result The proposed method outperforms state-of-the-art Bitcoin price prediction methods.
Neural networks improve cancer risk prediction from family history data.
problem Improving cancer risk prediction from family history data using machine learning.
method Developed and trained neural network models on large pedigrees to predict hereditary cancers.
result Neural networks can achieve nearly optimal prediction performance and outperform traditional models in misreported data.
The paper explains why estimating a history-dependent policy can reduce MSE in reinforcement learning.
problem Understanding why history-dependent policies can improve MSE in off-policy evaluation.
method The paper derives a bias-variance decomposition of MSE for various OPE estimators, showing how history-dependent policies can decrease variance and increase bias.
result History-dependent policies can decrease the variance of importance sampling estimators, leading to lower MSE.
New algorithm minimizes regret in stochastic linear bandits with perturbed history.
problem Minimizing cumulative regret in stochastic linear bandits.
method Perturbed-history exploration in a linear bandit (LinPHE) algorithm.
result Achieves a O ( d n ) O(d \sqrt{n}) O ( d n ) gap-free bound on cumulative regret. Generative model for discrete objects using Markov chains with valid transitions.
problem Generating valid discrete objects with unique construction histories.
method Markov chain with restricted local operations that preserve validity.
result Generative model produces valid discrete objects and compares favorably to alternatives.
It is shown how the generating functional method of De Dominicis can be used to solve the dynamics of the original version of the minority game (MG), in which agents observe real as opposed to fake market histories. Here one again finds exact closed equations for correlation and response functions, but now these are de…
This paper suggests claim history will be deprecated in future auto insurance rates.
problem The role of historical claim records in auto insurance rates.
method Proposes a new risk variable elimination method and real-time road risk model design.
result Claim history will be considered a 'noise' factor and deprecated in Pay-How-You-Drive models.
This paper creates a comprehensive BTC transaction network dataset spanning 15 years.
problem Lack of a full-history BTC graph and network property dataset.
method Thorough analysis of BTC transaction network, creating a dataset and investigating decentralization.
result First systematic investigation of BTC's asset decentralization and design of decentralization degrees.
We present in this chapter (Chapter II) the history of ideas which lead up to the development of modern knot theory. We are more detailed when pre-XX century history is reported. With more recent times we are more selective, stressing developments related to Jones type invariants of links. In the Appendix, A.Przybyszew…
PHE adds pseudo-rewards to history to minimize regret in stochastic bandits.
problem Minimizing cumulative regret in stochastic multi-armed bandits.
method PHE algorithm that adds O ( t ) O(t) O ( t ) i.i.d. pseudo-rewards to history and pulls the best arm based on the perturbed history. result Near-optimal regret bounds derived for PHE.
The paper tackles the problem of recovering network history from structure, identifying a phase transition in recoverability.
problem Recovering the history of complex networks from their current structure.
method Bayesian formulation, sequential Monte Carlo algorithm, heuristic approach.
result Identification of a phase transition in the quality of reconstructed history.
DDP models dynamic comorbidity networks from event data.
problem Understanding complex temporal patterns of co-occurring diseases.
method Developed deep diffusion processes (DDP) to model dynamic comorbidity networks.
result DDP enables accurate risk prediction and interpretable disease trajectories.
SDSR reconstructs species trees from genetic markers efficiently.
problem Challenges in reconstructing species trees from genetic data.
method Spectral divide-and-conquer approach based on graph theory.
result SDSR achieves up to 10-fold faster runtime with comparable accuracy.
DR-FRL learns functional states from irregular histories for causal inference.
problem Causal inference with irregularly sampled longitudinal data.
method DR-FRL workflow combining functional and temporal encoders, nuisance heads, and EIF-targeted validation.
result DR-FRL can improve causal inference when pseudo-outcomes are heavy-tailed or measurement is informative.
DArtNet predicts time series data using graph structure and dynamic attributes.
problem Predicting time series data using graph structure and dynamic attributes.
method DArtNet learns static and dynamic embeddings for graph nodes and encodes history information using RNN for joint link and attribute prediction.
result Improved time series prediction accuracy on five datasets.
Paper tackles reinforcement learning for STL specifications with state history.
problem Learning optimal policies to satisfy STL specifications often requires too much state history, making the problem computationally intractable.
method Proposes a compact augmented state-space representation to capture state history and an approximation method to solve the objective.
result Shows the performance bound of the approximate solution and compares it with an existing technique.
GCNET predicts stock price movements using graph convolutional networks.
problem Predicting stock price movements using interrelated stocks data.
method GCNET models stock relations as an influence network, uses graph convolutional networks for prediction.
result GCNET significantly improves prediction accuracy and MCC measures.
A new method improves meta-learning for few-shot learning.
problem Catastrophic forgetting and robustness issues in meta-learning.
method CML-BGNN: Bayesian Graph Neural Networks for continual meta-learning.
result Improves performance by 42.8% on miniImageNet 5-way 1-shot classification.
Cold-start PV forecasting uses synthetic histories to train time-series foundation models.
problem Cold-start PV forecasting
method Zero-shot pipeline with synthetic histories
result TabPFN-TS achieves the lowest error under Real Feedback strategy