TNC learns time series representations by leveraging temporal neighborhoods.
problem Complex, unlabeled time series data.
method Temporal Neighborhood Coding (TNC) with a debiased contrastive objective.
result TNC outperforms other unsupervised methods in time series clustering and classification.
EHNA learns node embeddings from historical network neighborhoods.
problem Capturing temporal information in evolving networks.
method Temporal random walk and deep learning model with attention mechanism.
result EHNA outperforms existing methods in network reconstruction and link prediction tasks.
Estimates time-varying network connections using multi-stage smoothing.
problem Estimating edge probabilities of time-varying networks.
method Multi-stage smoothing: temporal local smoothing followed by node-domain smoothing.
result Captures both smooth temporal evolution and structural patterns in connectivity.
TSAM predicts directed temporal links using GCN and self-attention.
problem Predicting links in directed temporal networks.
method GCN, self-attention mechanism, autoencoder architecture, graph attentional layers, graph convolutional layers, graph recurrent unit layer.
result TSAM outperforms benchmarks on four realistic networks.
TGAT learns node embeddings for evolving graphs, capturing both static and temporal features.
problem Learning node embeddings for dynamic graphs with evolving topological structures and temporal patterns.
method Temporal Graph Attention (TGAT) layer using self-attention and functional time encoding.
result TGAT model can inductively infer node embeddings for new and observed nodes as the graph evolves.
VisitHGNN predicts visit probabilities between neighborhoods and POIs using graph neural networks.
problem Estimating visit probabilities between neighborhoods and POIs for urban planning.
method Heterogeneous, relation-specific graph neural network (VisitHGNN) trained on mobility data.
result Strong predictive performance with high fidelity to observed travel behavior.
In a dynamic network, the neighborhood of the vertices evolve across different temporal snapshots of the network. Accurate modeling of this temporal evolution can help solve complex tasks involving real-life social and interaction networks. However, existing models for learning latent representation are inadequate for …
Study of convergence in Lorentzian spacetimes using temporal functions.
problem Non-compactness of spacetime isometries and convergence in semi-Riemannian settings.
method Introduced anchored convergence and used Cauchy temporal functions to define convergence for spacetimes.
result Established local and global regularity of Cauchy temporal functions and their properties.
Predicts local AQI using mobile sensor data, improving accuracy by 71.654 MSE.
problem Inaccurate AQI data from sparse sensors in developing countries.
method Spatio-temporal GNNs for fine-grained AQI forecasting.
result Significant improvement in AQI prediction accuracy (71.654 MSE reduction).
Lorentzian distances to Cauchy surfaces fail to be locally equi-Lipschitz.
problem Lorentzian distances to Cauchy surfaces
method Conjectures based on Cauchy temporal functions
result Lorentz distances to Cauchy surfaces are not locally equi-Lipschitz
Paper analyzes convergence of Adam-type RL algorithms under Markovian sampling.
problem Theoretical convergence analysis of Adam-type RL algorithms.
method Develops techniques for analyzing convergence under Markovian sampling.
result PG-AMSGrad and TD-AMSGrad converge to stationary points or global optima at specified rates.
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…
Knowledge graph reasoning is a critical task in natural language processing. The task becomes more challenging on temporal knowledge graphs, where each fact is associated with a timestamp. Most existing methods focus on reasoning at past timestamps and they are not able to predict facts happening in the future. This pa…
TGNN4I model forecasts irregularly observed graph data using ODEs.
problem Forecasting graph-structured data with irregular time steps and partial observations.
method Introduces a time-continuous latent state in each node using ODEs and GRUs, integrating graph neural network layers.
result Validated usefulness of graph structure and time-continuous dynamics in irregular observation settings.
Efficiently estimates longitudinal networks by merging sparse networks.
problem Estimating longitudinal networks with sparse and temporal data.
method Adaptive network merging, tensor decomposition, point process.
result Significantly reduces estimation error and provides guidance for network merging.
New algorithms for collaborative reinforcement learning with limited communication.
problem Efficiently learning value functions in multi-agent systems with strict information constraints.
method Distributed gradient-based temporal difference algorithms with consensus schemes.
result Parameter estimates converge to ODEs with defined invariant sets under general assumptions.
Improved TD learning reduces variance and bias errors.
problem Inefficient optimization variance in TD learning.
method Proposed a mathematically solid analysis of VRTD, showing linear convergence rate and reduced variance and bias errors.
result VRTD converges to a fixed-point solution with reduced variance and bias errors compared to vanilla TD.
This paper improves convergence bounds for AC and NAC algorithms with function approximation.
problem Improving convergence bounds for actor-critic algorithms with function approximation.
method Non-asymptotic analysis of AC and NAC algorithms with compatible function approximation.
result Eliminates the term ε_critic from the error bounds while maintaining best known sample complexities.
Decentralized TD learning converges linearly with linear function approximation.
problem Policy evaluation in fully decentralized multi-agent reinforcement learning.
method Temporal-difference learning with linear function approximation, analyzing i.i.d. and Markovian samples.
result Local estimates converge linearly to the optimum under both i.i.d. and Markovian samples.
We derive spectral sequences for the intersection homology of stratified fibrations and approximate tubular neighborhoods in manifold stratified spaces. These neighborhoods include regular neighborhoods in PL stratified spaces.
CityTFT models urban building energy using a data-driven approach.
problem Current UBEM methods are time-consuming and based on physics.
method CityTFT uses a TFT framework with an augmented loss function.
result CityTFT predicts energy demands with high accuracy.
Making an adaptive prediction based on one's input is an important ability for general artificial intelligence. In this work, we step forward in this direction and propose a semi-parametric method, Meta-Neighborhoods, where predictions are made adaptively to the neighborhood of the input. We show that Meta-Neighborhood…
NNK algorithm improves neighborhood and graph construction for machine learning.
problem Ad hoc selection of k and ε parameters in kNN and ε-neighborhood methods.
method NNK algorithm for better sparse signal approximation.
result NNK leads to superior performance in local neighborhood and graph-based machine learning tasks.
We propose a simple discrete time semi-supervised graph embedding approach to link prediction in dynamic networks. The learned embedding reflects information from both the temporal and cross-sectional network structures, which is performed by defining the loss function as a weighted sum of the supervised loss from past…
Study geodesics entering a fixed cusp neighborhood multiple times.
problem Understanding geodesics entering a specific cusp neighborhood multiple times.
method Investigate reciprocal geodesics entering a fixed cusp neighborhood a fixed number of times.
result Characterized the class of reciprocal geodesics entering a fixed cusp neighborhood a fixed number of times.
Urban2Vec combines street view imagery and POIs for better urban neighborhood embeddings.
problem Lack of comprehensive representation of urban neighborhoods using heterogeneous data.
method Unsupervised multi-modal framework using CNN for visual features and bag-of-words for POI data.
result Urban2Vec achieves better performance than baseline models and comparable to fully-supervised methods.
In this paper, we prove that if g(t) is a smooth, complete solution to the Ricci flow of uniformly bounded curvature on M×[0,Ω], then the correspondence t↦g(t) is real-analytic at each t0∈(0,Ω). The analyticity is a consequence of classical Bernstein-type estimates on the temporal and spatial …
MRA-BGCN improves traffic forecasting accuracy through complex graph interactions.
problem Challenging traffic forecasting due to spatial-temporal dependency and uncertainty.
method Proposes MRA-BGCN, a deep learning model that uses bicomponent graph convolution and multi-range attention.
result MRA-BGCN achieves state-of-the-art results on real-world traffic datasets.
Skeleta and other pure subsets of manifold stratified spaces are shown to have neighborhoods which are teardrops of stratified approximate fibrations (under dimension and compactness assumptions). In general, the stratified approximate fibrations cannot be replaced by bundles, and the teardrops cannot be replaced by ma…
New framework distinguishes knots via neighborhood invariants.
problem Distinguishing knots and knotoids.
method Study of knotoid spectra and neighborhood invariants.
result Neighborhood invariants can distinguish knots of higher Gordian distance.
This paper tackles selection bias in recommender systems by considering the neighborhood effect.
problem Selection bias in recommender systems due to filtering and user selection.
method Formalizes neighborhood effect as interference problem, introduces treatment representation, and proposes ideal loss.
result Proposed methods achieve unbiased learning when both selection bias and neighborhood effect are present.
Maximally hyperbolic solutions contain future neighborhoods of intersecting hypersurfaces.
problem Maximally globally hyperbolic solutions of higher-dimensional vacuum Einstein equations.
method Analyzing intersections of characteristic hypersurfaces.
result Contains a future neighborhood of intersecting hypersurfaces.
Many prediction problems can be phrased as inferences over local neighborhoods of graphs. The graph represents the interaction between entities, and the neighborhood of each entity contains information that allows the inferences or predictions. We present an approach for applying machine learning directly to such graph…
Proposes a new NMF method incorporating neighborhood structure for better anomaly detection.
problem NMF's inability to incorporate neighborhood structure information limits its performance in nonlinear manifold structures.
method Integrates neighborhood structure information using Minimum Spanning Tree (MST) within NMF framework.
result Empirical results show superior performance in anomaly detection using the proposed method.
Study on transverse knots and their neighborhoods, proving unique standard neighborhoods and destabilization results.
problem Understanding the structure and properties of transverse knots and their neighborhoods.
method Proves unique standard neighborhoods and structure theorems for non-loose Legendrian knots through destabilization results.
result Finds a manifold with infinite tight contact structures, up to contactomorphism, without Giroux torsion.
Revises GNN neighborhood aggregation for more accurate node classification.
problem Flaws in benchmark GNN models for node classification.
method Statistical signal processing approach to neighborhood aggregation.
result Novel insights for designing more efficient GNN models.
Proposes RNNE for dynamic network embedding.
problem Handling dynamic networks with changing node and edge counts.
method Recurrent Neural Network Embedding (RNNE) for topologically evolving graphs and temporal graphs.
result RNNE outperforms state-of-the-art algorithms in network reconstruction, classification, and link prediction.
The study proves a neighborhood theorem for mean curvature flow in higher dimensions.
problem Proving a canonical neighborhood theorem for mean curvature flow in higher dimensions.
method Proved a canonical neighborhood theorem for mean curvature flow of compact submanifolds in RN with a pinching condition. result Proved a canonical neighborhood theorem for mean curvature flow in dimensions n≥5. A neighborhood homotopy is an equivalence relation on spatial graphs which is generated by crossing changes on the same component and neighborhood equivalence. We give a complete classification of all 2-component spatial graphs up to neighborhood homotopy by the elementary divisor of a linking matrix with respect to th…
GraphAIR improves graph representation learning by capturing non-linear interactions.
problem Challenges in capturing non-linear interactions in graph data.
method Integrates neighborhood aggregation and interaction modeling.
result Demonstrates improved performance on node classification and link prediction tasks.
Neighborhood sampling affects graph neural network training outcomes.
problem Understanding the impact of neighborhood sampling on graph neural network training.
method Theoretical analysis using neural tangent kernels and Gaussian processes.
result Posterior covariance differs for different neighborhood sampling approaches, indicating no dominant approach.
In this paper, we consider recommender systems with side information in the form of graphs. Existing collaborative filtering algorithms mainly utilize only immediate neighborhood information and have a hard time taking advantage of deeper neighborhoods beyond 1-2 hops. The main caveat of exploiting deeper graph informa…
Learning graph-structured data with graph neural networks (GNNs) has been recently emerging as an important field because of its wide applicability in bioinformatics, chemoinformatics, social network analysis and data mining. Recent GNN algorithms are based on neural message passing, which enables GNNs to integrate loc…
We present novel graph kernels for graphs with node and edge labels that have ordered neighborhoods, i.e. when neighbor nodes follow an order. Graphs with ordered neighborhoods are a natural data representation for evolving graphs where edges are created over time, which induces an order. Combining convolutional subgra…
We present a new construction of tubular neighborhoods in (possibly infinite dimensional) Riemannian manifolds M, which allows us to show that if G is an arbitrary group acting isometrically on M, then every G-invariant submanifold with locally trivial normal bundle has a G-invariant total tubular neighborhood. We appl…
Real-time crime forecasting is important. However, accurate prediction of when and where the next crime will happen is difficult. No known physical model provides a reasonable approximation to such a complex system. Historical crime data are sparse in both space and time and the signal of interests is weak. In this wor…
In this paper, we present a method to determine the global horizontal irradiance (GHI) from the power measurements of one or more PV systems, located in the same neighborhood. The method is completely unsupervised and is based on a physical model of a PV plant. The precise assessment of solar irradiance is pivotal for …
This article is one of three highly influential articles on the topology of manifolds written by Robert D. Edwards in the 1970's but never published. Organizers of the Workshops in Geometric Topology (http://www.uwm.edu/~craigg/workshopgtt.htm) with the support of the National Science Foundation have facilitated the pr…