Method clusters molecular systems based on dynamics or structure similarity.
problem Clustering molecular systems based on dynamics or structure similarity.
method Ward's minimum variance clustering using Jensen-Shannon divergence.
result Method avoids overfitting in supervised learning.
Proposes neural similarity for CNNs to enhance flexibility and performance.
problem Limited flexibility of inner product-based convolution in CNNs.
method Introduces neural similarity as a learnable parametric similarity measure, and proposes NSL for adaptive learning from data.
result Dynamic neural similarity improves flexibility and performance in visual recognition and few-shot learning.
Study shows similarities and differences in crypto and equity dynamics during pandemic.
problem Comparing cryptocurrency and equity market dynamics during the pandemic.
method New methodologies applied to study cryptocurrency and equity market dynamics, including recently introduced methods for trajectory and anomaly analysis.
result Cryptocurrencies exhibit stronger collective dynamics and correlation, while equities show greater persistence in anomalies over time.
I propose a frequency domain adaptation of the Expectation Maximization (EM) algorithm to group a family of time series in classes of similar dynamic structure. It does this by viewing the magnitude of the discrete Fourier transform (DFT) of each signal (or power spectrum) as a probability density/mass function (pdf/pm…
Matrix factorization is a key component of collaborative filtering-based recommendation systems because it allows us to complete sparse user-by-item ratings matrices under a low-rank assumption that encodes the belief that similar users give similar ratings and that similar items garner similar ratings. This paradigm h…
Inverse depth scaling found in LLMs due to similar layers averaging error.
problem Understanding how depth affects loss in large language models.
method Analysis of LLMs and toy residual networks.
result Loss scales inversely proportional to depth in LLMs.
New algorithm adapts to unknown demand smoothness for dynamic pricing.
problem Dynamic pricing with unknown Hölder smoothness of demand function.
method Self-similarity condition and adaptive algorithm.
result Adaptive algorithm achieves minimax optimal regret without prior knowledge of smoothness.
GoT-WAVE improves temporal network alignment by 25% accuracy and 64% speed.
problem Finding conserved network regions in temporal networks.
method Using graphlet-orbit transitions (GoTs) as a dynamic node similarity measure within DynaWAVE.
result GoT-WAVE outperforms DynaWAVE in accuracy and speed on synthetic networks.
We study the dynamics of correlation and variance in systems under the load of environmental factors. A universal effect in ensembles of similar systems under the load of similar factors is described: in crisis, typically, even before obvious symptoms of crisis appear, correlation increases, and, at the same time, vari…
This study analyzes cryptocurrency price dynamics using complexity-entropy causality.
problem Understanding the price dynamics of cryptocurrencies during market booms and busts.
method Used permutation-information-theory quantifiers and complexity-entropy causality plane.
result Discerned three distinct dynamics in cryptocurrency price data.
Enhances load forecasting for multiple entities with dynamic similarities.
problem Inaccurate probabilistic load predictions due to uncertainties and dynamic changes.
method Online multi-task learning for probabilistic load forecasting.
result Significantly enhances load forecasting accuracy across various scenarios.
End-to-end graph-based SSL learns all graph factors dynamically.
problem Learning quality of graph in SSL is crucial but difficult.
method Proposes an end-to-end approach to optimize all graph factors.
result Demonstrates effectiveness on benchmark datasets.
Improved speech segment clustering using FTDTW.
problem Clustering speech segments of varying lengths and features.
method Feature Trajectory Dynamic Time Warping (FTDTW) for pairwise alignment of feature trajectories.
result Consistent and statistically significant improvements in cluster quality (F-measure and NMI).
ContraSim learns financial headline similarities for market forecasting.
problem Financial market forecasting accuracy improvement.
method ContraSim framework with Weighted Headline Augmentation and WSSCL.
result Improves financial forecasting accuracy by 7%.
Learn dynamics of a system using auxiliary data from similar systems.
problem Learning dynamics of a linear system with limited data.
method Weighted least squares approach, incorporating auxiliary data.
result Auxiliary data can help reduce intrinsic error due to noise.
Study uses auxiliary data to estimate system dynamics, reducing noise error.
problem Estimating system dynamics from similar but not identical systems.
method Weighted least squares approach with performance guarantees.
result Effective use of auxiliary data reduces estimation error due to process noise.
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.
Meta-Dynamic models learn shared neural dynamics across tasks.
problem Learning latent dynamics from neural recordings across different tasks.
method Captures variabilities on a low-dimensional manifold to meta-learn dynamics.
result Meta-Dynamic models can rapidly learn latent dynamics from new recordings.
We study the dynamic interactions and structural changes in global financial indices in the years 1998-2012. We apply a principal component analysis (PCA) to cross-correlation coefficients of the stock indices. We calculate the correlations between principal components (PCs) and each asset, known as PC coefficients. A …
Deep neural networks and glassy systems share dynamics but differ in landscape properties.
problem Comparing training dynamics of DNNs and glassy systems.
method Statistical physics methods applied to DNN training.
result DNN dynamics slow down due to many flat directions, diffusing at the loss minimum.
The Ricci flow is a parabolic evolution equation in the space of Riemannian metrics of a smooth manifold. To some extent, Einstein equations give rise to a similar hyperbolic evolution. The present text is an introductory exposition to Bianchi-Ricci and Bianchi-Einstein flows, that is, the restricted finitely dimension…
Using high-frequency time series of stock prices and share volumes sizes from January 2002-May 2009, this paper investigates whether the effects of the onset of high-frequency trading, most prominent since 2005, are apparent in the dynamics of the dollar traded volume. Indeed it is found in almost all of 14 heavily tra…
Sharp changes in time series representing market dynamics are studied by means of the self--similar analysis suggested earlier by the authors. These sharp changes are market booms and crashes. Such crises phenomena in markets are analogous to critical phenomena in physics. A simple classification of the market crisis p…
From a sequence of similarity networks, with edges representing certain similarity measures between nodes, we are interested in detecting a change-point which changes the statistical property of the networks. After the change, a subset of anomalous nodes which compares dissimilarly with the normal nodes. We study a sim…
Develops a kernel for financial time series analysis.
problem Measuring similarity between evolving financial networks.
method Commute time matrix, dynamic time warping, Shannon entropy.
result Proposes a kernel for financial time series analysis.
Dynamic Time Warping improves regression accuracy on spectroscopy data.
problem Improving regression accuracy on spectroscopy data with DTW when data is across multiple wavelengths.
method Illustrated DTW's effectiveness on spectroscopy time-series data, showing its benefits in improving regression accuracy when only a single wavelength is considered. DTW combined with k-Nearest Neighbour reveals similarities and differences at the time-series level.
result DTW improves regression accuracy on spectroscopy data, especially when considering a single wavelength.
A dynamic ResNet model learns different routes for images from different classes.
problem Fixed structure in ResNet-like architectures limits their adaptability to diverse inputs.
method Develops a ResNet-based model that dynamically selects Computational Units for each input image.
result Achieves better results on CIFAR-10 test set compared to the original ResNet-38 architecture.
Proposes dynamic borrowing method for historical data in clinical trials.
problem Insufficient statistical power in rare and pediatric disease clinical trials.
method Dynamic borrowing method based on frequentist approach using similarity measures.
result Demonstrates usefulness of dynamic borrowing in reanalyzing clinical trial data.
This paper improves forecasts for diverse time series by averaging similar ones.
problem Forecasting challenges in heterogeneous time series.
method Dynamic Time Warping to find similar time series, k-Nearest Neighbor averaging.
result Averaging improves forecasts of simple models.
New insights show embedding lengths correlate with semantic properties.
problem Contrastive embedding norms ignore embedding magnitudes but correlate with semantic properties.
method Formal theoretical framework and analysis of optimization dynamics.
result Embedding lengths encode semantic information as a byproduct of training.
Dyna optimizes momentum for stochastic optimization of neural networks.
problem Optimizing neural networks with momentum for stochastic optimization.
method Introduces fictitious mass to regularize adaptive stepsize in momentum gradient descent.
result Promises improved performance and convergence in preliminary trials.
Deep learning models can infer individual trajectories from sparse data.
problem Learning individual dynamics from limited data points.
method Combining variational autoencoders (VAEs) with ordinary differential equations (ODEs) for dynamic modeling.
result Deep learning can recover individual trajectories from sparse data, but requires careful adaptation.
We propose and systematically evaluate three strategies for training dynamically-routed artificial neural networks: graphs of learned transformations through which different input signals may take different paths. Though some approaches have advantages over others, the resulting networks are often qualitatively similar…
We describe a general method to construct completely bounded idempotent mappings on operator spaces, starting from amenable semigroups of completely bounded mappings. We then explore several applications of that method to injective operator spaces, fixed points of completely contractive mappings, Toeplitz operators, dy…
OMD and DA perform similarly in static settings but OMD is inferior under dynamic learning rates.
problem Proving and understanding the performance difference between OMD and DA under dynamic learning rates.
method Introducing stabilization to OMD and modifying its convergence analysis.
result OMD with stabilization and DA have the same performance guarantees under dynamic learning rates.
Study on stability of hyperkähler flow in 4-manifolds.
problem Stability of hyperkähler flow in 4-manifolds.
method Extending results from mean curvature flow for minimal surfaces to hyperkähler flow.
result Obtained a dynamic stability theorem for hyperkähler flow.
CTGCN learns dynamic graph embeddings preserving both local and global graph structure.
problem Learning node representations for evolving graphs while preserving both local and global graph structure.
method CTGCN uses k-core based temporal graph convolutional network to learn dynamic graph embeddings.
result CTGCN outperforms existing methods in link prediction and structural role classification.
Combines Kleinian groups and polynomials into a dynamical system.
problem Connecting Kleinian groups and rational dynamics.
method Framework for combining Fuchsian groups with complex polynomials.
result Establishes a new dynamical system on the Riemann sphere.
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.
Noise-robust Koopman operator framework for control with improved stability and performance.
problem Developing a stable and noise-robust Koopman operator for control tasks.
method Proposes a learning framework using Hankel matrix and neural network approximations for system dynamics, ensuring long-term stability and noise robustness.
result Demonstrates improved model performance and noise robustness in control tasks compared to existing methods.
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.
Extremely accurate prediction of dynamical system bifurcations using control inputs.
problem Predicting complex bifurcation structures in dynamical systems.
method Extending extreme learning machines with control inputs to model system dynamics.
result The model can nearly reproduce the entire structure of bifurcations using only a few parameter values.
hood2vec identifies urban area similarity via mobility networks.
problem Identifying similar urban areas using mobility networks.
method Learning node embeddings of the mobility network from Foursquare check-ins.
result Mobility dynamics capture different aspects of urban area similarity than venue types.
Financial market dynamics is rigorously studied via the exact generalized Langevin equation. Assuming market Brownian self-similarity, the market return rate memory and autocorrelation functions are derived, which exhibit an oscillatory-decaying behavior with a long-time tail, similar to empirical observations. Individ…
SPINEX improves time series forecasting with explainable neighbors.
problem Enhancing time series forecasting accuracy and interpretability.
method Leverages similarity and higher-order temporal interactions across multiple scales.
result SPINEX consistently ranks among top performers in forecasting precision.
STRAPSim measures ETF portfolio similarity better than existing methods.
problem Measuring portfolio similarity for ETFs and portfolios.
method Semantic, two-level, residual-aware portfolio similarity computation.
result STRAPSim outperforms existing methods in predictive accuracy and ranking alignment.
Method learns to map dynamics of different systems.
problem Mapping dynamics of different systems.
method Learned latent dynamical system for mapping.
result Learned correspondences enable imagined motions and bisimulation.
New model-free algorithm achieves similar LQR regret guarantees.
problem Model-free control of linear dynamical systems under quadratic costs.
method Online policy gradient scheme with policy space cost analysis.
result Achieves regret scaling with √T, matching model-based methods.