New methods estimate transport-growth pairs in unbalanced optimal transport.
problem Statistical guarantees for Monge-type estimation in unbalanced optimal transport remain limited.
method Developed two estimators for transport-growth pairs under different setups.
result Achieved minimax optimal rate for estimation of transport-growth pairs.
Overparameterized models generalize well in offline contextual bandits, but policy-based algorithms struggle.
problem The performance gap between value-based and policy-based algorithms in offline contextual bandits with overparameterized models.
method Analysis of action-stability in objectives and formal proofs of regret bounds.
result The performance gap is due to action-stability of objectives, with value-based objectives being stable and policy-based objectives unstable.
The paper evaluates company investment value using machine learning models.
problem Evaluating the investment value of companies based on machine learning.
method Data mining, feature selection, cross-validation, stacking model, Bayesian Ridge Regression.
result The RMSE of the final model is 3.047, indicating improved stability and generalization.
While biomanufacturing plays a significant role in supporting the economy and ensuring public health, it faces critical challenges, including complexity, high variability, lengthy lead time, and very limited process data, especially for personalized new cell and gene biotherapeutics. Driven by these challenges, we prop…
Proposes a value-based method for continuous control without an actor.
problem Computational infeasibility of evaluating Q-values in continuous action spaces.
method Structurally maximizable Q-functions, actor-free approach.
result Performance and sample efficiency comparable to actor-critic methods.
New method improves stability of soft FQI for offline RL.
problem Stability issues in soft FQI under function approximation.
method Stationary reweighting to align operator norms.
result Local linear convergence proved under certain conditions.
New issue found in value-based reinforcement learning for stochastic environments.
problem Value-based reinforcement learning struggles with stochastic state transitions.
method Demonstrated using a multiobjective Markov Decision Process (MOMDP).
result Approaches may converge to Pareto-dominated solutions instead of optimal ones.
Characterizes pseudo-Anosov mapping classes on general marked surfaces.
problem Stability of mapping classes on marked surfaces.
method Cluster algebraic description and reduction procedure of mapping classes.
result Characterizes pseudo-Anosov mapping classes in terms of uniform sign stability.
We give a systematic treatment of the stability theory for action of a real reductive Lie group G on a topological space. More precisely, we introduce an abstract setting for actions of non-compact real reductive Lie groups on topological spaces that admit functions similar to the Kempf-Ness function. The point of this…
This work explores representation complexity in RL paradigms, revealing model-based RL as the easiest task.
problem Investigating the representation complexity gap among model-based, policy-based, and value-based RL.
method Demonstrated through analysis of Markov decision processes (MDPs) and introduced new classes of MDPs.
result Representation complexity hierarchy: model-based RL > policy-based RL > value-based RL.
A hierarchical approach improves classification accuracy in large datasets.
problem Improving classification accuracy in large datasets with high dimensionality.
method Hierarchical subspace learning to scale manifold learning methods.
result Average 5% increase in classification accuracy.
Modern deep learning methods provide effective means to learn good representations. However, is a good representation itself sufficient for sample efficient reinforcement learning? This question has largely been studied only with respect to (worst-case) approximation error, in the more classical approximate dynamic pro…
The basic financial purpose of a firm is to maximize its value. An inventory management system should also contribute to realization of this basic aim. Many current asset management models currently found in financial management literature were constructed with the assumption of book profit maximization as basic aim. H…
The paper develops stability criteria for real reductive Lie groups acting on manifolds.
problem Analyzing stability of real reductive Lie group actions on manifolds.
method Introduced a gradient map and maximal weight function to characterize stability conditions.
result Characterized stability, semistability, and polystability using numerical criteria.
This paper improves reinforcement learning policies in a scalable way.
problem Ensuring monotonic policy improvement in entropy-regularized RL.
method Derives an entropy-aware lower bound and proposes a novel RL algorithm.
result Demonstrates effectiveness in continuous-state tasks using a linear function approximator.
G. Tian and S.K. Donaldson formulated a conjecture relating GIT stability of a polarized algebraic variety to the existence of a Kahler metric of constant scalar curvature. In [Don02] Donaldson partially confirmed it in the case of projective toric varieties. In this paper we extend Donaldson's results and computations…
NROWAN-DQN improves stability and exploration in noisy networks.
problem Noisy networks struggle with stable exploration in complex tasks.
method Noise reduction and online weight adjustment for stable actions.
result NROWAN-DQN outperforms prior algorithms in stability and exploration.
Value functions struggle to represent transition dynamics, impacting statistical efficiency.
problem Limited representational power of value functions in capturing transition dynamics.
method Case studies of various reinforcement learning problems to explore the limitations of value-based methods.
result Value-based methods can be as efficient as model-based ones in some cases but severely underperform in others due to information loss.
This work ensures stability in POD basis interpolation for pMOR in hyperelasticity.
problem Stability of POD basis interpolation on Grassmann manifolds for pMOR in hyperelasticity.
method Stability conditions derived from Grassmannian Exponential map and principal angles.
result Explicit stability conditions for practical pMOR applications and non-monotonic error behavior.
In this paper we study the relative Chow and K-stability of toric manifolds in the toric sense. First, we give a criterion for relative K-stability and instability of toric Fano manifolds in the toric sense. The reduction of relative Chow stability on toric manifolds will be investigated using the Hibert-Mumford cr…
Tutorial on optimizing diffusion model samples for specific metrics.
problem Optimizing diffusion model samples for specific downstream metrics.
method Review and exploration of inference-time guidance and alignment methods.
result Unified perspective on inference-time algorithms and novel methods.
Study of hyperkähler reduction on abelian varieties and toric manifolds.
problem Understanding hyperkähler reduction on specific manifolds.
method Lifts canonical Kähler reduction to hyperkähler, studies on abelian varieties and toric manifolds.
result Obtains decoupling result, variational characterisation, relation to K-stability, and proves existence and uniqueness under suitable assumptions. For feature selection and related problems, we introduce the notion of classification game, a cooperative game, with features as players and hinge loss based characteristic function and relate a feature's contribution to Shapley value based error apportioning (SVEA) of total training error. Our major contribution is ($…
TF-Coder simplifies tensor manipulation programming in TensorFlow.
problem Difficulty in programming with TensorFlow due to steep learning curve.
method Bottom-up weighted enumerative search with value-based pruning and type/value filtering.
result Solves 63 out of 70 real-world tasks within 5 minutes.
Paper presents a novel method to assess boundedness and stability of nonlinear systems with variable delays.
problem Challenges in assessing boundedness and stability of vector nonlinear systems with variable delays and coefficients.
method Develops a novel framework to evaluate the evolution of solution norms in such systems by constructing scalar counterparts.
result Introduces new criteria for boundedness and stability and estimates the radii of containing balls for history functions.
Paper proposes an unsupervised feature selection algorithm with stability guarantees.
problem Feature selection for dimension reduction and interpretability.
method Proposes a novel unsupervised feature selection algorithm with stability guarantees.
result The algorithm has superior generalization performance and stable selected features.
We study the K-stability of a polarised variety with non-reductive automorphism group. We associate a canonical filtration of the co-ordinate ring to each variety of this kind, which destabilises the variety in several examples which we compute. We conjecture this holds in general. This is an algebro-geometric analogue…
Value-based methods constitute a fundamental methodology in planning and deep reinforcement learning (RL). In this paper, we propose to exploit the underlying structures of the state-action value function, i.e., Q function, for both planning and deep RL. In particular, if the underlying system dynamics lead to some glo…
It is known that the automorphism group of a K-polystable Fano manifold is reductive. Codogni and Dervan construct a canonical filtration of the section ring, called Loewy filtration, and conjecture that the Loewy filtration destabilizes any Fano variety with non-reductive automorphism group. In this note, we give a co…
Study stability of Einstein metrics on homogeneous spaces.
problem Stability of Einstein metrics on homogeneous spaces.
method Formula for Lichnerowicz Laplacian of G-invariant TT-tensors to study stability.
result Detailed study of naturally reductive Einstein metrics.
Unified framework for CO problems using RL, providing optimal solutions and convergence guarantees.
problem Combinatorial optimization problems
method Unified framework of Markov decision processes (MDPs) and value-based reinforcement learning (RL) techniques
result RL techniques converge to approximate solutions with a guarantee on optimality gap
Study evaluates valuation models for UK companies using case studies.
problem Determining how accounting numbers affect business value.
method Comprehensive review of three valuation models: FCFVM, REVM, AEGM.
result Accounting numbers through valuation models can affect business value.
Study on reducing dimensionality in high-dimensional regression with kernel methods and stability analysis.
problem Analyzing errors in high-dimensional regression with dimensionality reduction and kernel regression.
method Derive a stability result for kernel regression with Wasserstein distance and apply it to PCA to deduce convergence rates.
result Two-step procedure yields useful convergence rates in semi-supervised settings.
Stochastic Q-learning tackles large action spaces with reduced computation.
problem Effective decision-making in complex environments with large discrete action spaces.
method Stochastic value-based RL approaches that consider a sublinear number of actions in each iteration.
result Stochastic Q-learning achieves near-optimal returns with significantly reduced computation time.
The paper improves reinforcement learning stability and efficiency with a new theoretical framework.
problem Stability and efficiency in reinforcement learning, especially in data-scarce scenarios.
method Theoretical framework using resampled U- and V-statistics to model experience replay, applied to policy evaluation and kernel ridge regression. result Significant improvements in stability and efficiency, particularly in data-scarce scenarios.
Unified view on selective credit assignment for reinforcement learning.
problem Efficient credit assignment in reinforcement learning.
method Unified temporal-difference algorithms with selective weightings.
result New algorithms for backward credit assignment and off-policy learning.
Enhanced CNN for financial data improves predictive accuracy and stability.
problem Complexity and variability in financial data.
method Normalization and Gradient Reduction Architecture.
result Improvement in model accuracy and stability.
Quantum model generates financial data with fewer parameters.
problem Generating financial data with fewer parameters.
method Applied time-series quantum generative model to financial data.
result Fewer parameters required compared to classical methods.
New method turns optimization algorithms into uniformly stable learning algorithms for non-Euclidean norms.
problem Non-Euclidean norms in binary classification problems.
method Black-box reduction method using uniformly convex regularizers.
result Achieves optimal statistical risk bounds on excess risk for non-Euclidean norms.
We embed polarised orbifolds with cyclic stabiliser groups into weighted projective space via a weighted form of Kodaira embedding. Dividing by the (non-reductive) automorphisms of weighted projective space then formally gives a moduli space of orbifolds. We show how to express this as a reductive quotient and so a GIT…
We assess cluster stability by trimming extreme points and tracking data range reduction.
problem Assessing stability of one-dimensional clusters.
method Probabilistic method using diameter-shrinkage ratio to track data range reduction.
result Our method achieves higher accuracy than classical tests in small or noisy samples.
The study analyzes sharpness dynamics in neural networks, revealing mechanisms and conditions.
problem Understanding sharpness in neural network training.
method Fixed point analysis and edge of stability analysis in a simplified 2-layer linear network.
result Reveals mechanisms behind sharpness trends, conditions for edge of stability, and a period-doubling route to chaos.
Paper presents a GMFG framework for large stochastic games.
problem Learning Nash Equilibrium in large stochastic games.
method Value-based and policy-based reinforcement learning algorithms with smoothed policies.
result Proposed algorithms GMF-V and GMF-P are efficient and robust in GMFG setting.
RCLA reduces noise in topological data analysis, preserving essential structure.
problem Noise in large datasets obscures topological features in persistent homology.
method Grid-based RCLA integrates data reduction and denoising with a threshold parameter.
result RCLA provides a theoretical guarantee and automatic parameter selection.
Paper computes stability of Q-Fano spherical varieties using test configurations and Futaki invariants.
problem Stability of Q-Fano spherical varieties.
method Test configurations, Futaki invariants, intersection numbers.
result Equivalence of stability criteria and existence of Kähler-Ricci g-solitons.
Variance reduction techniques like SVRG provide simple and fast algorithms for optimizing a convex finite-sum objective. For nonconvex objectives, these techniques can also find a first-order stationary point (with small gradient). However, in nonconvex optimization it is often crucial to find a second-order stationary…
New RL algorithms adapt to time limits, improving task performance.
problem Fixed RL behaviors cannot adapt to different time restrictions.
method Introduced two algorithms for time adaptive RL: Independent Gamma-Ensemble and n-Step Ensemble.
result Zero-shot adaptation between different time restrictions.
Pretraining reinforcement learning methods with demonstrations has been an important concept in the study of reinforcement learning since a large amount of computing power is spent on online simulations with existing reinforcement learning algorithms. Pretraining reinforcement learning remains a significant challenge i…