Extends Gauduchon's result to higher dimensions, showing balanced metrics.
problem Understanding critical metrics in higher-dimensional Hermitian manifolds.
method Analyzes the functional of L2-norm of torsion 1-form and full Chern torsion. result Critical metrics are balanced in all dimensions.
TOPPO improves PPO for MTRL by balancing critic gradients, outperforming SAC.
problem Critic-side gradient ill-conditioning in PPO for MTRL.
method Critic Balancing modules to improve gradient conditioning and balance task updates.
result TOPPO achieves stronger mean and tail-task performance than SAC-family and ARS-family baselines.
We describe several configurations of clasped ropes which are balanced and thus critical for the Gehring ropelength problem of arXiv:math.DG/0402212.
New approach finds Kähler metrics on compact complex manifolds.
problem Finding Kähler metrics on compact complex manifolds.
method Defining a new functional whose critical points are Kähler metrics.
result Critical points of the new functional are precisely the Kähler metrics.
In 1974, Gehring posed the problem of minimizing the length of two linked curves separated by unit distance. This constraint can be viewed as a measure of thickness for links, and the ratio of length over thickness as the ropelength. In this paper we refine Gehring's problem to deal with links in a fixed link-homotopy …
Let f:S2→S2 be an orientation-preserving branched covering map of degree d≥2, and let Σ be an oriented Jordan curve passing through the critical values of f. Then Γ:=f−1(Σ) is an oriented graph on the sphere. In a group email discussion in Fall 2010, W. Thurston introduced balanced planar graphs a…
In this paper we study 1/k-geodesics, those closed geodesics that minimize on any subinterval of length l(γ)/k. We employ energy methods to provide a relationship between the 1/k-geodesics and what we define as the balanced points of the uniform energy. We show that classes of balanced points of the uniform energy pe…
In this paper we establish a relationship between geodesic nets and critical points of the distance function. We bound the number of balanced points for certain minimizing geodesic nets on manifolds homeomorphic to the n-sphere. We also bound the length of certain minimizing geodesic nets.
Paper surveys balanced metrics and proves a geodesic convexity result.
problem Understanding balanced metrics and stability in algebraic geometry.
method Survey and proof of geodesic convexity result.
result Geodesically convex function on a complete Riemannian manifold admits a critical point if and only if its asymptotic slope at infinity is positive.
USAC balances pessimism and optimism in actor-critic training for better exploration and performance.
problem Excessive pessimism limits exploration, while excessive optimism leads to high-risk behaviors.
method Utility Soft Actor-Critic (USAC) dynamically adapts exploration based on critic uncertainty.
result USAC consistently outperforms state-of-the-art algorithms in continuous control tasks.
New deep learning method improves financial stress testing accuracy.
problem Traditional stress testing methods are criticized for unrealistic assumptions and estimation errors.
method Proposes a novel Deep Learning approach for Dynamic Balance Sheet Stress Testing.
result Empirical results show significant improvement in accuracy over traditional methods.
From the work of Dervan-Keller, there exists a quantization of the critical equation for the J-flow. This leads to the notion of J-balanced metrics. We prove that the existence of J-balanced metrics has a purely algebro-geometric characterization in terms of Chow stability, complementing the result of Dervan-Keller. We…
Study constructs balanced datasets for seismic failure prediction.
problem Imbalanced datasets limit machine learning performance in seismic failure prediction.
method Framework with three steps: GMF identification, probability density estimation, and sample transformation.
result Framework improves machine learning performance in seismic failure mode prediction.
We define a quantisation of the J-flow over a projective complex manifold. As corollaries, we obtain new proofs of uniqueness of critical points of the J-flow and that these critical points achieve the absolute minimum of an associated energy functional. We show that the existence of a critical point of the J-flow impl…
Study reveals structural differences in financial networks near and far from crises using balance theory.
problem Understanding the complex behavior of stocks and their collective behavior in financial crises.
method Investigates financial networks by triplet interaction in the framework of balance theory, focusing on higher-order interactions.
result Formation of an ordered structure in crisis networks makes them resistant to disorder, with a critical temperature measuring crisis strength.
New meta-learning method improves domain generalization by balancing parameters closer to domain centroids.
problem Improving domain generalization by reducing overfitting to specific domains.
method Arithmetic meta-learning with arithmetic-weighted gradients to balance parameters closer to domain centroids.
result Experimental validation of improved domain generalization performance.
Meta-SAC automatically tunes SAC's entropy temperature for better exploration.
problem Exploration-exploitation dilemma in reinforcement learning.
method Meta-SAC uses metagradient and a novel meta objective to automatically adjust SAC's entropy temperature.
result Meta-SAC outperforms SAC-v2 by 10% on the humanoid-v2 task.
A new algorithm speeds up rerandomization for better experiment balance.
problem Achieving optimal covariate balance in randomized experiments.
method Metropolis-Hastings framework with sampling-importance resampling.
result PSRSRR achieves significant speedups while maintaining statistical guarantees.
This paper surveys various data balancing methods for imbalanced datasets.
problem Imbalanced datasets bias predictions and degrade classifier performance.
method Extensive review of oversampling, undersampling, adaptive, generative, combination, and ensemble methods.
result No single method universally outperforms others; selection depends on dataset characteristics.
Paper explores balancing market dynamics and interpretable forecasting models for energy prices.
problem Tackles the challenge of accurately predicting mFRR price and understanding market dynamics.
method Compares XGBoost and EBM for forecasting mFRR activation price in the balancing market.
result EBM provides comparable forecasting accuracy to XGBoost but with higher interpretability.
Study tackles balancing policy switching costs in offline RL.
problem Balancing the cost of policy switching in offline RL.
method Optimal transport ideas and Net Actor-Critic algorithm.
result Demonstrated efficiency on multiple RL benchmarks.
We study partition functions of random Bergman metrics, with the actions defined by a class of geometric functionals known as `stability functions'. We introduce a new stability invariant - the critical value of the coupling constant - defined as the minimal coupling constant for which the partition function converges.…
Physics-guided reinforcement learning optimizes swimming in turbulent flows.
problem Optimizing swimming efforts to maintain proximity in turbulent environments.
method Physics-informed actor-physicist reinforcement learning algorithm.
result Physics-informed reinforcement learning outperforms standard methods in turbulent flow control.
Urban transformations within large and growing metropolitan areas often generate critical dynamics affecting social interactions, transport connectivity and income flow distribution. We develop a statistical-mechanical model of urban transformations, exemplified for Greater Sydney, and derive a thermodynamic descriptio…
This review analyzes deep learning methods for electricity price forecasting across different markets.
problem Insufficient analysis of deep learning methods in electricity price forecasting.
method Unified taxonomy of deep learning components, analysis of trends across markets.
result Shift toward probabilistic, microstructure-centric, and market-aware designs.
Accuracies of survival models for life expectancy prediction as well as critical-care applications are significantly compromised due to the sparsity of samples and extreme imbalance between the survival (usually, the majority) and mortality class sizes. While a recent random survival forest (RSF) model overcomes the li…
New theory predicts deep neural networks can operate in an extended critical regime without fine-tuning.
problem Understanding the dynamics and computational principles of deep neural networks.
method Combining theories of heavy-tailed random matrices and non-equilibrium statistical physics.
result Deep neural networks can operate in an extended critical regime without fine-tuning parameters.
In this paper, we consider an obstruction to asymptotic Chow-semistability of a polarized Kaehler algebraic manifold. Even when a linear algebraic group of positive dimension acts nontrivially and holomorphically on a polarized Kaehler algebraic manifold with constant scalar curvature, the vanishing of the obstruction …
Fair active learning selects data points to balance model accuracy and fairness.
problem Ensuring fairness in machine learning models used in high-stakes applications.
method Designing algorithms for fair active learning that select data points to balance model accuracy and fairness, focusing on demographic parity.
result Demonstrated the effectiveness of the proposed fair active learning approach over benchmark datasets.
Model shows how banks' hidden-to-maturity accounting can mask run risk and lead to financial instability.
problem Run risk and hidden-to-maturity accounting in banking systems.
method Balance sheet model and optimization problem to assess run risk and resilience.
result Held-to-maturity accounting can mask revaluation losses and increase run risk.
CARL safely adapts RL agents for safety-critical tasks.
problem Safety hazards in RL for safety-critical tasks.
method CARL combines model-based RL and cautious adaptation.
result CARL achieves higher rewards with fewer failures in safety-critical tasks.
New method identifies critical states to improve RL agent explainability and speed.
problem Challenges in RL agent explainability and action selection timing.
method Identify critical states based on action-based variance in Q-function, prioritize exploitation on these states.
result Identified critical states accelerate RL in grid worlds and deep RL tasks.
Generalized Thurston's characterization for branched coverings of the 2-sphere.
problem Characterize branched coverings of the 2-sphere.
method Introduced local balance and operations against balanced graphs.
result New proof of a theorem by Eremenko-Gabrielov-Mukhin-Tarasov-Varchenko.
TAET tackles long-tailed distributions in adversarial robustness.
problem Long-tailed distributions complicate adversarial robustness in real-world applications.
method TAET integrates an initial stabilization phase followed by a stratified equalization adversarial training phase.
result TAET achieves significant improvements in robustness and efficiency.
New testing method for robust actor-critic bandit algorithms.
problem Balancing data collection for app performance and user adherence.
method Modified actor-critic algorithm and novel testing procedure.
result Testing procedure is robust to critic misspecification.
AEA dynamically aggregates ensemble targets for actor-critic learning.
problem Static ensemble aggregation methods struggle with overestimation bias and variance.
method Adaptive Ensemble Aggregation (AEA) dynamically constructs ensemble-based targets.
result AEA converges to optimal variance reduction and maximal Fisher information.
The paper studies matrix normalization and graph balancing using a new functional and gradient descent.
problem Matrix normalization and graph balancing.
method A new functional called the non-normal energy, and gradient descent.
result Gradient descent of the non-normal energy converges to balanced graphs and preserves spectra and realness of weights.
The cost-sensitive classification problem plays a crucial role in mission-critical machine learning applications, and differs with traditional classification by taking the misclassification costs into consideration. Although being studied extensively in the literature, the fundamental limits of this problem are still n…
Estimates density ratio for two-sample comparison using tree models.
problem Comparing two distributions given i.i.d. observations.
method Additive tree models with balancing loss for density ratio estimation.
result Bayesian inference provides uncertainty quantification for density ratio.
In this paper we are concerned with the learnability of energies from data obtained by observing time evolutions of their critical points starting at random initial equilibria. As a byproduct of our theoretical framework we introduce the novel concept of mean-field limit of critical point evolutions and of their energy…
The aim of the present article is to offer a strictly mathematical, statistical treatment of the current account balances in EU and in the Eurozone. Based on Eurostat data, an overview of the total and annual balances is first made for different collections among the EU countries. Then, using the Mathematica technical …
Deciding what and when to observe is critical when making observations is costly. In a medical setting where observations can be made sequentially, making these observations (or not) should be an active choice. We refer to this as the active sensing problem. In this paper, we propose a novel deep learning framework, wh…
Optimizes liquidations in decentralized finance to manage credit risk.
problem Managing and liquidating positions in decentralized finance exchanges.
method Formulated as an ergodic optimal control problem, derived closed-form solutions for optimal liquidation strategies.
result Closed-form solutions balance immediate executions with price impacts and long-term rewards.
This paper introduces blind adversarial pruning to balance accuracy, efficiency, and robustness in neural networks.
problem Balancing accuracy, efficiency, and robustness in neural networks with limited resources.
method Adversarial pruning with a cutoff-scale strategy to dynamically adjust the strength of adversarial examples.
result Blind adversarial pruning improves the overall AER of pruned models compared to adversarial pruning.
In practical machine learning systems, graph based data representation has been widely used in various learning paradigms, ranging from unsupervised clustering to supervised classification. Besides those applications with natural graph or network structure data, such as social network analysis and relational learning, …
Proposes a new framework for balancing average- and worst-case performance in machine learning.
problem Robustness issues in machine learning, especially in safety-critical domains.
method Probabilistic robustness framework that balances average- and worst-case performance.
result Effective algorithm balances average- and worst-case performance with lower computational cost.
New gauge fields modify Fokker-Planck dynamics without changing the stationary state.
problem Understanding and modifying nonreversible dynamics in Fokker-Planck models.
method Formulate nonreversible perturbations as gauge fields, mapping to supersymmetric Hamiltonians, and learning finite forces.
result Learned finite forces can recover the optimal Lyapunov-equation solution in nonconvex landscapes.
IndiSeek learns disentangled representations by balancing independence and completeness.
problem Learning disentangled representations with mutual information in multi-modal data.
method Combines independence-enforcing objective with a reconstruction loss that bounds conditional mutual information.
result Demonstrates effectiveness on synthetic data, CITE-seq, and real-world multi-modal benchmarks.