A new model forecasts optimal portfolio weights from high-frequency data.
problem Forecasting optimal portfolio weights from high-frequency data.
method Dynamic Conditional Weights (DCW) model for portfolio weights dynamics.
result DCW model outperforms other models in portfolio allocations and measures.
A new stock selection strategy uses combined machine learning with dynamic weighting methods.
problem Improving stock selection accuracy and performance.
method Combined machine learning algorithms with static and dynamic weighting methods.
result IC-based dynamic weighting outperforms static evaluation metrics in backtested returns and predictive performance.
This paper improves forecast stability without sacrificing accuracy using dynamic loss weighting.
problem Rolling origin forecast instability in time series forecasting.
method Dynamic loss weighting algorithms applied to the N-BEATS model.
result Dynamic loss weighting can further improve forecast stability without compromising accuracy.
A RL approach dynamically assigns and updates weights of ensemble models for better time series forecasting.
problem Static weight assignment for ensemble models fails to capture dynamic data changes.
method Reinforcement Learning (RL) to dynamically update weights of each model at different time instants.
result Dynamic weighted approach using RL learns weights better than static methods.
Study reveals dynamics of neural networks with normalization, weight decay, and SGD.
problem Understanding the equilibrium condition in Spherical Motion Dynamics (SMD).
method Investigates SMD by exploring the cause of equilibrium condition, introducing assumptions, proposing angular update, and verifying theoretical results.
result Proves weight norm and angular update can converge at linear rate under given assumptions.
HydaLearn dynamically adjusts task weights for better MTL performance.
problem Constant loss weights in MTL lead to poor results due to drifting relevance and varying mini-batch composition.
method HydaLearn uses mini-batch gradients to dynamically adjust task weights.
result HydaLearn improves performance on synthetic and real-world data.
Weight decay stabilizes training dynamics by slowing progressive sharpening.
problem Understanding how weight decay affects training stability in deep learning models.
method Analyzing weight decay effects at the Edge of Stability, developing a mathematical framework.
result Weight decay dampens oscillations and stabilizes sharpness in CNNs, causing a phase transition in MLPs.
A new approach optimizes weights in DLP for better risk-adjusted performance.
problem Optimizing time-varying weights in Double Linear Policy (DLP) for better risk-adjusted performance.
method Stochastic Model Predictive Control (SMPC) framework to maximize risk-adjusted returns while enforcing constraints.
result Empirical results show improved risk-adjusted performance and drawdown control.
This paper studies recursive ensembles driven by Fibonacci updates, improving learning dynamics.
problem Improving learning dynamics in recursive ensemble learning.
method Develops second-order recursive architectures with Fibonacci-type update flows.
result Establishes global convergence conditions and generalization bounds for recursive ensembles.
Dynamic-weight AMMs outperform traditional CEX rebalancing in tokenized funds, especially on L2s.
problem Improving asset allocation efficiency in decentralized finance (DeFi) protocols.
method Block-level arbitrage analysis and long-term performance benchmarks on two live pools.
result Dynamic-weight AMMs can achieve performance comparable to or better than traditional CEX rebalancing, especially on Layer 2 (L2) networks.
Estimates RL data for dynamic treatment effects using GMM.
problem Estimating dynamic treatment effects from RL data with nonstationary behavior policies.
method Weighted GMM approach to stabilize variance in adaptive RL settings.
result Valid hypothesis testing and confidence regions for dynamic treatment effects.
SLERP interpolation optimizes dynamic weight rebalancing in AMMs.
problem Optimizing dynamic weight rebalancing in automated market makers (AMMs).
method Riemannian geometry and SLERP interpolation.
result SLERP interpolation minimizes the KL divergence loss in dynamic weight rebalancing.
Algorithm learns weight matrix from single trajectory of nonlinear dynamical system.
problem Learning weight matrix from a single trajectory of nonlinear dynamical system.
method Algorithm uses global stability and well-conditioned covariance to recover weight matrix.
result Algorithm recovers weight matrix with optimal sample complexity and linear running time.
The paper analyzes neural network dynamics after weights escape the origin.
problem Understanding gradient flow dynamics of neural networks after the origin.
method Analyzes gradient flow of homogeneous neural networks with locally Lipschitz gradients.
result Characterizes the first saddle point encountered after escaping the origin.
In this note, we study the dynamics and associated zeta functions of conformally compact manifolds with variable negative sectional curvatures. We begin with a discussion of a larger class of manifolds known as convex co-compact manifolds with variable negative curvature. Applying results from dynamics on these spaces,…
Proposes HOTA-FedGradNorm for faster and robust PFL in noisy channels.
problem Statistical heterogeneity across clients in federated learning.
method Dynamic weighting, OTA aggregation, hierarchical federated learning.
result Training speed improvement and robustness against channel effects.
This paper examines MEV attacks in dynamic AMMs and proposes new protections.
problem Dynamic AMMs introduce new MEV attack vectors due to inter-block weight changes.
method Analyzed inter-block weight changes as analogous to trades, conducted simulations.
result New inter-block protections are required to guard against multi-block MEV attacks.
The paper studies invariant weighted Bergman metrics on domains.
problem Investigating invariant weighted Bergman metrics under biholomorphisms.
method Introducing invariant weight assignments, using Bergman's minimum integral method and domain version of Tian-Yau-Zelditch expansion.
result Uniform convergence of weighted Bergman kernels and metrics on uniform squeezing domains.
A framework for multi-label sentiment analysis in 100 languages with dynamic weighting.
problem Cross-lingual sentiment analysis in multi-label settings with label imbalance.
method Dynamic weighting method, focal loss adaptation, optimal class-specific thresholds.
result State-of-the-art performance in 7 out of 9 metrics across 3 languages.
Many real-world decision problems are characterized by multiple conflicting objectives which must be balanced based on their relative importance. In the dynamic weights setting the relative importance changes over time and specialized algorithms that deal with such change, such as a tabular Reinforcement Learning (RL) …
GFM models neural network training as a dynamical system to forecast final weights.
problem Computational intensity and inefficiency in training deep neural networks.
method Gradient Flow Matching (GFM) treats training as a dynamical system with learned vector fields.
result GFM achieves forecasting accuracy competitive with Transformer-based models and significantly outperforms classical baselines.
Multi-task learning is a method for improving the generalizability of multiple tasks. In order to perform multiple classification tasks with one neural network model, the losses of each task should be combined. Previous studies have mostly focused on multiple prediction tasks using joint loss with static weights for tr…
Decentralized optimization on dynamic manifolds with improved regret bound.
problem Optimizing on nonstationary Riemannian manifolds in decentralized systems.
method Decentralized projected Riemannian gradient descent with weighted Frechet mean consensus.
result Achieved dynamic regret bound of O ( T ( 1 + P T ) / ( 1 − σ 2 ( W ) ) ) {\cal O}(\sqrt{T(1+P_T)}/\sqrt{(1-σ_2(W))}) O ( T ( 1 + P T ) / ( 1 − σ 2 ( W )) ) . Constraints improve deep neural network training by stabilizing and enhancing robustness.
problem Vanishing/exploding gradients and poor weight magnitudes in deep neural networks.
method Weight-constrained stochastic dynamics using Langevin dynamics framework.
result Enhanced exploration of the loss landscape and improved generalization.
A new method for deep learning under distribution shift by iteratively refining importance weighting.
problem Handling distribution shift in deep learning models when training and test data distributions differ.
method Dynamic Importance Weighting (dynamic IW) that iterates between weight estimation and weighted classification, using a pre-trained feature extractor and stochastic optimization.
result Dynamic IW outperforms state-of-the-art methods in experiments with various types of distribution shift on multiple datasets.
The paper introduces a dynamic MVP model using high-frequency financial data.
problem Capturing the dynamics of minimum variance portfolio weights in financial markets.
method Imposes autoregressive structure on MVP processes and uses CLIME and LASSO for estimation.
result Proposes DR-MVP model with established asymptotic properties.
Spectral portfolio theory links neural networks to wealth dynamics via SGD weight matrices.
problem Understanding wealth dynamics from neural network training.
method Direct identification of weight matrices as portfolio allocation matrices, linking SGD forces to portfolio dynamics.
result Spectral properties of SGD weight matrices transition between additive and multiplicative regimes, influencing wealth dynamics.
NTK-SAP improves neural network pruning by aligning training dynamics.
problem Improving neural network pruning to reduce training time and memory.
method Prune connections based on the spectrum of the Neural Tangent Kernel (NTK), using multiple random weight realizations and random inputs.
result Empirically, NTK-SAP achieves better performance than all baselines on multiple datasets.
DFR models dynamic distributional data with weighted Fréchet means.
problem Regression of distribution-valued responses over time.
method Dynamic Fréchet Regression (DFR) with index-aware weighting and feature selection.
result Improved predictive accuracy and feature recovery over existing methods.
A method to improve time series forecasting by dynamically adjusting weights of forecasters.
problem Challenges in time series forecasting due to evolving data distributions.
method Dynamic re-weighting of forecasters based on evolving data distributions.
result Competitive performance compared to state-of-the-art methods for combining forecasters.
Theoretical justification for deep networks' performance with regularization techniques.
problem Understanding the performance of deep networks trained with the square loss.
method Analysis of gradient flow and theoretical justification of regularization techniques.
result Convergence to solutions with smaller Frobenius norms leads to better classification error bounds.
In Dynamic Ensemble Selection (DES) techniques, only the most competent classifiers are selected to classify a given query sample. Hence, the key issue in DES is how to estimate the competence of each classifier in a pool to select the most competent ones. In order to deal with this issue, we proposed a novel dynamic e…
New loss function helps learn unstable dynamical systems.
problem Gradient descent fails to learn unstable dynamical systems.
method Introduced a time-weighted logarithmic loss function.
result Time-weighted loss function effectively learns unstable systems.
A hybrid framework prices options using neural networks and VAE latent space.
problem Lack of explicit asset dynamics information in compressed volatility surfaces.
method Combining Weighted Monte Carlo with neural networks trained on VAE latent space.
result Effective pricing of vanilla and exotic options on idealized vol surface.
WiGS improves active learning for regression by dynamically selecting informative samples.
problem Reducing labeling costs in regression tasks.
method Formulated as a reinforcement learning problem, WiGS adapts the exploration-investigation balance.
result WiGS outperforms static methods in accuracy and labeling efficiency, especially in irregular data density.
Proposes DSW for unbiased ITE estimation with dynamic confounders.
problem Estimating ITE from dynamic observational data with time-varying confounders.
method Deep Sequential Weighting (DSW) infers hidden confounders using current treatment assignments and historical information.
result DSW generates unbiased and accurate treatment effects.
Comment on entropy learning for dynamic treatment regimes.
problem Evaluating dynamic treatment regimes using entropy loss.
method Optimization-based alternative to IPW estimate.
result Suggests optimization-based approach for evaluation.
CW-EDMD improves prediction accuracy by learning local Koopman models for different state-space regions.
problem Inefficient global Koopman operator approximation for distinct local dynamics.
method Cluster-Weighted EDMD (CW-EDMD) learns a soft phase-space partition and per-cluster EDMD operators using EM objective.
result CW-EDMD significantly reduces prediction errors across various systems and configurations.
This paper reveals periodic behavior in neural network training with BN and weight decay.
problem Understanding the dynamics of neural network training with BN and weight decay.
method Rigorous investigation of empirical and theoretical mechanisms.
result Periodic behavior in training is a generalization of previously opposing perspectives.
A new method improves flow matching by dynamically weighting density estimates.
problem High-dimensional integration inefficiency in flow matching.
method Density-weighted Dynamic Stein operators.
result Significant improvement in vector field smoothness and sampling efficiency.
Deep equilibrium models converge globally without explicit computation.
problem Global convergence of deep learning models with implicit layers.
method Analysis of gradient dynamics and proof of convergence rate.
result Deep equilibrium models converge to global optimum at a linear rate.
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.
It is well known that the initialization of weights in deep neural networks can have a dramatic impact on learning speed. For example, ensuring the mean squared singular value of a network's input-output Jacobian is O ( 1 ) O(1) O ( 1 ) is essential for avoiding the exponential vanishing or explosion of gradients. The stronger condi…
Study on feature learning dynamics in infinite-depth neural networks, focusing on ResNets.
problem Understanding how features evolve during training in deep neural networks, especially in the large-depth limit.
method Conditional Gaussian representations and SDE system with decoupled backward weights.
result Depth-induced suppression of forward-backward coupling in infinite-depth networks, leading to a decoupled forward-backward SDE system.
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.
Optimal rebalancing strategy improves AMM pool performance by 25%.
problem Optimizing the sequence of weights in dynamic AMM pools to minimize rebalancing costs.
method Using optimal interpolation and a cheap-to-compute approximation to achieve nearly optimal rebalancing.
result Approximately-optimal weight changes lead to significant increases in pool performance (up to 25%) under various conditions.
Optimizes sliding window approach for tracking Gaussian densities.
problem Improving tracking performance of Gaussian density estimation.
method Theoretical analysis of sliding window Gaussian Kernel Density Estimators.
result Empirical evidence shows improved tracking performance with optimal weight sequence.
Random feature maps improve forecasting with cheaper computation.
problem Improving forecasting accuracy with random feature maps.
method Developed a hit-and-run algorithm to select optimal internal weights.
result Optimal internal weights lead to superior forecasting skill.