The paper provides a representation for dynamic risk measures and capital allocations.
problem Representation of dynamic risk measures and capital allocations under Itô-Lévy model.
method Representation theorem for dynamic capital allocation derived from BSDEs with quadratic-exponential growth.
result Derivation of a capital allocation representation for dynamic entropic risk measure and static coherent risk measure.
Model learns disentangled static and dynamic data representations.
problem Learning disentangled representations from unordered data.
method Factorized graphical model exploiting sequential data regularities.
result Well-organized latent space for data dynamics.
DySAT learns dynamic graph node representations capturing structural and temporal patterns.
problem Learning latent representations of nodes in dynamic graphs.
method Dynamic Self-Attention Network (DySAT) that combines self-attention layers for structural and temporal dimensions.
result DySAT outperforms state-of-the-art baselines in link prediction on dynamic graphs.
RNNs compute by warping neural representations over time.
problem Understanding how RNNs perform task computations.
method Developed a Riemannian geometric framework to derive the manifold topology and geometry of RNNs.
result Dynamic warping is a fundamental feature of RNN computations.
FAVAE learns disentangled representations from sequential data.
problem Learning disentangled and interpretable representations from sequential data.
method FAVAE uses the information bottleneck principle without supervision.
result FAVAE can disentangle multiple dynamic factors.
Modified group captures braid dynamics, revealing Burau kernel.
problem Detecting the kernel of the Burau representation for braids.
method Defined a modified group Gn3 and its representation. result The modified group's representation detects the Burau kernel.
New method visualizes brain activity changes over time.
problem Understanding representational dynamics in neural responses.
method Procrustes-aligned Multidimensional Scaling (pMDS) on RDM movies.
result Multidimensional scaling alignment captures representational dynamics.
Recommender system improves with temporal representations.
problem Improving interpretability and performance in recommender systems.
method Incorporates temporal representations via recurrent point process in continuous time.
result Characterizes effects of perception, interest, and seasonal changes on reviews.
In this paper we will provide a representation of the penalty term of general dynamic concave utilities (hence of dynamic convex risk measures) by applying the theory of g-expectations.
The paper studies dynamic star-shaped risk measures and their representation.
problem Representing dynamic star-shaped risk measures and their properties.
method Representation theorems for dynamic monetary and star-shaped risk measures.
result Dynamic star-shaped risk measures can be represented as the lower envelope of a family of dynamic convex risk measures.
Temporal-difference (TD) networks are a class of predictive state representations that use well-established TD methods to learn models of partially observable dynamical systems. Previous research with TD networks has dealt only with dynamical systems with finite sets of observations and actions. We present an algorithm…
Study on how optimal representations emerge during deep learning training, focusing on the role of implicit regularization.
problem Understanding how optimal representations for tasks are learned during training.
method Investigates the role of implicit regularization in learning minimal sufficient representations, analyzing changes in representation content during training.
result Semantically meaningful but ultimately irrelevant information is encoded in early transient dynamics of training, which is later discarded.
New metric measures dynamical richness without relying on accuracy.
problem Lack of a reliable metric for measuring dynamical richness.
method Developed a computationally efficient, performance-independent metric based on low-rank bias.
result Metric recovers neural collapse as a special case and captures known transitions without accuracy.
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.
Efficiently extracts linear dynamics from complex observations.
problem Learning policies directly from rich, high-dimensional observations.
method Modeling linear dynamics in a hidden subspace and developing an efficient algorithm.
result Successfully extracts linear dynamics from rich observations.
How can we effectively encode evolving information over dynamic graphs into low-dimensional representations? In this paper, we propose DyRep, an inductive deep representation learning framework that learns a set of functions to efficiently produce low-dimensional node embeddings that evolves over time. The learned embe…
FILDNE learns dynamic graph embeddings efficiently.
problem Learning node embeddings on evolving graphs.
method Integrates static graph learning methods into dynamic graphs using convex combination and alignment.
result FILDNE reduces memory and computational costs while improving downstream task performance.
Feature normalization prevents collapse in non-contrastive learning dynamics.
problem Non-contrastive learning can collapse into a single point due to lack of repulsive force.
method Extended previous theory based on L2 loss to cosine loss, considering feature normalization.
result Cosine loss induces stable equilibrium, preventing collapse even with insufficient repulsive force.
Paper develops a new model for dynamic graph representation learning.
problem Learning over dynamic graphs with changing topology and node attributes.
method Hierarchical variational model with latent random variables and semi-implicit variational inference.
result SI-VGRNN and VGRNN outperform existing methods in dynamic link prediction.
Efficiently updates vertex representations for dynamic graphs using random walks.
problem Updating vertex representations for dynamic graphs without re-generating them on each update.
method Proposes algorithms that extend random walk-based methods to dynamic graphs, considering the extent and rate of changes.
result Achieves competitive results to state-of-the-art methods while being computationally efficient.
GRADE models evolving graph dynamics by learning node and community representations.
problem Lack of tools to study temporal community dynamics in evolving graphs.
method GRADE is a probabilistic model that learns evolving node and community representations via a random walk prior and variational inference.
result GRADE outperforms baselines in dynamic link prediction and dynamic community detection.
A new dynamical approach connects resolution cohomology to group representations.
problem Establishing a bijection between resolution cohomology and group representations.
method Gauge-theoretic Morse flow on the minimal resolution.
result The flow converges to specific irreducible representations of the group.
A framework for learning disentangled representations of symmetric environments.
problem Discovering and modelling the underlying structure of environments.
method Group representation theory for disentangled representations of dynamical environments.
result Our method enables accurate long-horizon predictions and correlates with disentanglement quality.
TV-SurvCaus improves causal inference for dynamic treatments in survival analysis.
problem Estimating causal effects of time-varying treatments on survival outcomes.
method Representation balancing techniques extended to time-varying treatment regimes with survival outcomes.
result TV-SurvCaus outperforms existing methods in estimating individualized treatment effects with time-varying covariates and treatments.
Dyn-VGAE learns evolving network structures.
problem Learning dynamic network representations.
method Dynamic joint Variational Graph Autoencoders (Dyn-VGAE).
result Dyn-VGAE captures temporal evolution in dynamic networks.
Proposes a new graph representation method using tensor products.
problem Dynamic graph representation and theoretical properties.
method Bind-and-sum approach in hyperdimensional computing (HDC), tensor product as binding operation.
result Memory vs. size analysis of graph representation size scaling.
Survey reviews recent advances in learning graph representations over time.
problem Challenges in learning and inference for evolving graphs.
method Categorizes models from encoder-decoder perspective, analyzes techniques.
result Highlights directions for future research in dynamic graph representation learning.
The paper proposes a framework to reason about object dynamics for faster reinforcement learning.
problem Current reinforcement learning approaches lack prior knowledge about the environment, limiting efficiency.
method Integrates object dynamics and behavior into reinforcement learning to improve efficiency.
result Demonstrates the need for reasoning about object behavior and dynamics, leading to faster learning.
AKOrN uses synchronized neurons to improve AI tasks.
problem Improving AI performance through better neural representations.
method AKOrN introduces synchronized neurons to replace threshold units.
result AKOrN improves performance across various AI tasks.
A new metric compares dynamical systems using operator eigenvalues.
problem Comparing and interpolating nonlinear dynamical systems from trajectory data.
method Representing systems as distributions of operator eigenvalues and projectors, defining a spectral-Grassmann Wasserstein metric.
result The proposed metric outperforms standard operator-based distances in machine learning applications.
GD-VAEs learn dynamics from observations using geometric and topological information.
problem Learning parsimonious representations of nonlinear dynamics from observations.
method Develops data-driven methods incorporating geometric and topological information using Variational Autoencoders (VAEs).
result GD-VAEs provide methods for learning reduced dimensional representations of nonlinear dynamics.
Machine learning models can lead to group representation disparity, affecting long-term retention.
problem Representation disparity in ML models can lead to group retention issues over time.
method Analyzed user dynamics and fairness criteria in a sequential decision-making framework.
result Representation disparity can worsen over time without proper fairness criteria.
Study Anosov representations of reducible suspensions of hyperbolic groups.
problem Characterize dynamical properties of reducible suspensions of Anosov representations.
method Analyzing linear representations of non-elementary hyperbolic groups, focusing on weak unipotent actions on subspaces.
result Characterize when reducible suspensions are discrete and faithful, quasi-isometrically embedded, and Anosov.
Gaussian processes for dynamical systems with Koopman equivariance.
problem Forecasting and learning representations of nonlinear dynamical systems.
method Koopman-equivariant Gaussian processes with linear time-invariant responses and trajectory-based equivariance.
result Enhanced forecasting performance compared to kernel-based methods.
Doctor2Vec learns doctor representations from EHRs for better clinical trial recruitment.
problem Identifying the right doctors for clinical trials based on EHR data and trial descriptions.
method Dynamic Memory Network with attention mechanism to learn doctor and trial representations.
result Improved performance by up to 8.7% in PR-AUC on real-world trials and EHR data.
Proposes continuous graph neural networks to capture long-range dependencies.
problem Capturing long-range dependencies in graph data.
method Defines continuous dynamics for graph neural networks using diffusion-based methods.
result Proposed continuous graph neural networks are effective and deeper networks can capture long-range dependencies.
Defines new representations for hyperbolic groups, unifying existing definitions.
problem Geometrically finite behavior in higher rank groups.
method Introduces a new family of discrete representations for relatively hyperbolic groups.
result Stability of these representations under certain deformations.
A new kernel framework analyzes spatio-temporal data from dynamic equations.
problem Analyzing spatio-temporal data from dynamic equations with noisy measurements.
method Kernel-based framework with representer theorem for minimizing error with given samples.
result Minimizes error in solutions of dynamic equations with noisy spatio-temporal data.
Survey on twisted dynamical zeta functions and Fried's conjecture.
problem Analyzing twisted dynamical zeta functions and their relation to Fried's conjecture.
method Review of existing literature and mini-course presentation.
result Discussion and validation of Fried's conjecture.
DSSM separates domain-invariant dynamics from domain-specifics in sequential data.
problem Learning cross-domain sequence representations from diverse data domains.
method Introduce disentangled state space models (DSSM) using unsupervised VAE-based training.
result Improves knowledge transfer and robust prediction across domains.
Most real world phenomena such as sunlight distribution under a forest canopy, minerals concentration, stock valuation, exhibit nonstationary dynamics i.e. phenomenon variation changes depending on the locality. Nonstationary dynamics pose both theoretical and practical challenges to statistical machine learning algori…
A new method predicts dynamical systems better by using two different latent spaces.
problem Predicting the future of dynamical systems with optimal accuracy.
method Uses two different latent mappings for present and future states.
result Optimal 2-mapping method significantly outperforms single latent representation methods.
The forecasting and reconstruction of ocean and atmosphere dynamics from satellite observation time series are key challenges. While model-driven representations remain the classic approaches, data-driven representations become more and more appealing to benefit from available large-scale observation and simulation dat…
Formulates Markov property for risk-sensitive dynamic optimisation.
problem Risk-sensitive dynamic optimisation problems in discrete time.
method Formulates probabilistic Markov property under dynamic risk framework.
result Property holds for standard risk measures and has multiple equivalent versions.
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 …
SCALOR learns scalable object representations for crowded scenes.
problem Scalability in scenes with many objects.
method Spatially-parallel attention and proposal-rejection mechanisms.
result SCALOR can handle up to a hundred objects in crowded scenes.
The paper explores how structured representations influence learning dynamics in neural networks.
problem Understanding the training dynamics of deep neural networks.
method Investigates a family of enriched transformation layers with constrained pathways and adaptive corrections.
result Improved robustness, smoother optimization, and scalable depth behavior are achieved through structured representations.
Model learns evolving network relationships over time.
problem Dimension reduction for dynamic network data.
method Metric functional space for vector-valued functions.
result Effective link prediction and role identification in dynamic networks.