Search arXiv⌕ Search

arXiv · 2610.23788

Parametric Resonance in Primal-Dual Learning for Slowly Non-Stationary Constrained MDPs

Abstract

Primal-dual methods for constrained Markov decision processes are analyzed under a two-timescale assumption, with non-stationarity entering through two channels. In the additive channel, where the constraint level oscillates, the dual oscillation saturates at a floor set by the moving optimum and is amplified linearly by the timescale ratio. In the parametric channel, where the constraint sensitivity oscillates, a coherent modulation carries no resonant forcing at any depth: the dual update's stiffness modulation cancels the primal update's damping modulation. Instability instead comes from a mismatch between the constraint estimate used by the primal update and the measurement used by the dual update, producing a parametric resonance at twice the pair's natural frequency. The tolerated mismatch grows with the square root of the forcing bandwidth and collapses with the square root of the dual-to-primal step-size ratio. These results hold on the tangent linear-quadratic reduction around an active saddle, for one constraint and for $K$ constraints under a common modulation and an isotropy condition. Driving both updates from the same estimate removes the resonant forcing but introduces a stationary offset equal to the estimator's bias. In a Lagrangian soft actor-critic agent, the multiplier locks onto the sub-harmonic at the timescale ratios its identified linear loop predicts and a coherent cost critic suppresses the lock-in, while a proportional (PID) term, predicted to leave the lock-in in place, suppresses most of it through the projection of the multiplier.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Maxime Baelde. 2026-10-16. Parametric Resonance in Primal-Dual Learning for Slowly Non-Stationary Constrained MDPs. https://arxiv.org/abs/2610.23788

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reinforcement Learning for Individual Optimal Policy from Heterogeneous Data

Offline reinforcement learning (RL) aims to find optimal policies in dynamic environments in order to maximize the expected total rewards by leveraging pre-collected data. Learning from heterogeneous data is one of the fundamental challenges in offline RL. Traditional methods focus on learning an optimal policy for all individuals with pre-collected data from a single episode or homogeneous batch episodes, and thus, may result in a suboptimal policy for a heterogeneous population. In this paper, we propose an individualized offline policy optimization framework for heterogeneous time-stationary Markov decision processes (MDPs). The proposed heterogeneous model with individual latent variables enables us to efficiently estimate the individual Q-functions, and our Penalized Pessimistic Personalized Policy Learning (P4L) algorithm guarantees a fast rate on the average regret under a weak partial coverage assumption on behavior policies. In addition, our simulation studies and a real data application demonstrate the superior numerical performance of the proposed method compared with existing methods.

stat.ML↗

Generative Flows for Potential Outcomes and Counterfactuals

Average treatment effects summarize how interventions change outcomes, but individualized decisions require predictions and outcome distributions of what would have happened to the same individual under an alternative treatment. We develop PO-Flow, a continuous normalizing flow framework that represents treatment-specific outcome distributions through invertible transport maps. It supports potential-outcome generation, conditional average treatment-effect estimation, factual-conditioned counterfactual prediction, and density evaluation. To address treatment imbalance in observational data, we incorporate cross-fitted inverse-probability weighting into the flow-matching loss. We establish sufficient conditions under which encoding a factual outcome and decoding under an alternative treatment recovers the individual counterfactual. Under shared exogenous noise and a common encoded reference distribution, scalar recovery follows from increasing noise-to-latent maps. For multivariate outcomes, we assume triangularity or a convex-gradient structure. These conditions distinguish fitting outcome distributions from recovering their causal correspondence. Experiments on four scalar benchmarks and seven multivariate or image settings, with dimensions up to 784, compare against ten scalar and five multivariate baselines. Controlled ablations show IPW improves all reported scalar counterfactual RMSE, PEHE, and potential-outcome RMSE. PO-Flow achieves the lowest PEHE and potential-outcome RMSE on all four scalar benchmarks and attains or ties the lowest mean in 26 of 35 multivariate dataset--metric comparisons.

stat.ML↗

Hybrid Topic-Semantic Labeling and Graph Embeddings for Unsupervised Legal Document Clustering

Legal documents pose substantial challenges for unsupervised knowledge discovery due to specialized domain terminology, multi-scale document lengths, and scarce expert annotations. This paper introduces Topic-Graph Spherical Fusion (TGSF), a dual-manifold representation learning framework for unsupervised legal document clustering that unifies dense topic-semantic discovery and relational graph embeddings on a joint unit hypersphere. Instantiating dense topic discovery via Top2Vec and biased second-order random walks via Node2Vec, TGSF constructs a connected multi-relational document-topic graph combining multi-topic centroid bridges with temperature-sharpened semantic k-Nearest Neighbor (k-NN) document edges, guaranteeing a single connected component. The resulting L2-normalized semantic and graph representations are fused via modality-weighted concatenation onto a joint unit hypersphere prior to KMeans partitioning, decomposing squared chordal distance into a convex combination of semantic and structural cosine similarities. Evaluations across three legal benchmarks (ACORD, CUAD, and LEDGAR) show that TGSF outperforms semantic-only, structural-only, Latent Dirichlet Allocation (LDA), Non-Negative Matrix Factorization (NMF), and TF-IDF baselines. Across 216 factorial grid configurations and 240 Bayesian TPE and Multi-Objective NSGA-II Pareto optimization trials per dataset (720 trials total), TGSF improves Normalized Mutual Information (NMI) from 0.606 to 0.653 on LEDGAR (ARI = 0.425), 0.228 to 0.284 on ACORD (ARI = 0.260), and 0.535 to 0.570 on CUAD (ARI = 0.282). Functional ANOVA and Pareto frontier diagnostics further characterize hyperparameter sensitivity for reproducible legal text mining.

stat.ML↗