FACMAC combines deep policy gradients with factored critic for multi-agent reinforcement learning.
problem Cooperative multi-agent reinforcement learning in discrete and continuous action spaces.
method FACMAC uses a centralised but factored critic, combining per-agent utilities into a joint action-value function.
result FACMAC outperforms MADDPG and other baselines on multi-agent particle environments and StarCraft II tasks.
Gradient descent with large steps leads to chaotic parameter space and unpredictable outcomes.
problem Understanding the behavior of gradient descent with large step sizes in matrix factorization.
method Analyzing the fractal structure of the parameter space and deriving critical step sizes for convergence.
result Gradient descent with large steps exhibits chaotic behavior and sensitivity to initialization, creating a fractal boundary between converging and diverging minimizers.
New result on critical points of Bethe free energy under deformation retracts.
problem Characterizing critical points of Bethe free energy for complex graphs.
method Analyzing homotopy types and deformation retracts of factor graphs.
result Critical points of Bethe free energy are invariant under deformation retracts.
This paper is concerned with the squared F(robenius)-norm regularized factorization form for noisy low-rank matrix recovery problems. Under a suitable assumption on the restricted condition number of the Hessian for the loss function, we derive an error bound to the true matrix for the non-strict critical points with r…
Study on deep matrix factorization with Bures-Wasserstein loss, focusing on critical points and convergence.
problem Analyzing critical points and convergence of generative deep linear networks trained with Bures-Wasserstein loss.
method Characterization of critical points and minimizers of Bures-Wasserstein distance, analysis of Hessian at low-rank matrices, convergence results for gradient flow and descent.
result Established convergence results for gradient flow and finite step size gradient descent under certain assumptions.
New insights into matrix factorization show strict saddles have bounded eigenvalues.
problem Understanding the nature of critical points in matrix factorization.
method Analyzing orbits of critical points under the general linear group and identifying canonical points.
result Minimum eigenvalue of strict saddles is not uniformly bounded below zero.
Recently, along with the emergence of food scandals, food supply chains have to face with ever-increasing pressure from compliance with food quality and safety regulations and standards. This paper aims to explore critical factors of compliance risk in food supply chain with an illustrated case in Vietnamese seafood in…
We develop a gluing procedure designed to obtain canonical metrics on connected sums of Einstein four-manifolds. The main application is an existence result, using two well-known Einstein manifolds as building blocks: the Fubini-Study metric on CP2 and the product metric on S2×S2. Using these met…
Deep Reinforcement Learning (DRL) algorithms for continuous action spaces are known to be brittle toward hyperparameters as well as \cut{being}sample inefficient. Soft Actor Critic (SAC) proposes an off-policy deep actor critic algorithm within the maximum entropy RL framework which offers greater stability and empiric…
Trace norm regularization is a widely used approach for learning low rank matrices. A standard optimization strategy is based on formulating the problem as one of low rank matrix factorization which, however, leads to a non-convex problem. In practice this approach works well, and it is often computationally faster tha…
Low-rank factorization is a standard way to make structured optimization problems in machine learning more tractable by replacing matrix variables with compact factors. For positive semidefinite (PSD) variables, the symmetric Burer--Monteiro factorization (sBMF) writes Z=XX⊤ with a single low-rank factor X. A r…
Model criticism is usually carried out by assessing if replicated data generated under the fitted model looks similar to the observed data, see e.g. Gelman, Carlin, Stern, and Rubin [2004, p. 165]. This paper presents a method for latent variable models by pulling back the data into the space of latent variables, and c…
Classification of Finslerian spaces with nontrivial concircular transformations.
problem Classifying Finslerian spaces with nontrivial concircular transformations.
method Proving the existence of at most two critical points in a conformal circle-preserving transformation and presenting a diffeomorphism classification based on these critical points.
result Presented a diffeomorphism classification of Finslerian manifolds that admit nontrivial conformal circle-preserving transformations.
Study non-convex matrix factorization using Riemannian geometry.
problem Matrix completion via non-convex optimization.
method Optimization over a Grassmannian manifold, analyzing principal angles.
result Geodesically convex region in matrix completion cost function.
Free maps exist on low-dimensional tori and closed surfaces.
problem Embedding closed surfaces in high-dimensional spaces.
method Factorization trick for constructing free immersions.
result Every closed surface embeds freely in \(\mathbb{R}^5\).
The paper evaluates variational auto-encoders using model criticism methods.
problem Evaluating the quality of variational auto-encoders (VAEs).
method Statistical model criticism, focusing on reproducing statistics of unknown data generating processes.
result The proposed framework offers possibilities for model selection beyond intrinsic metrics.
Study uses healthcare claims data to identify Covid-19 risk factors without prior selection.
problem Identify risk factors for severe Covid-19 cases.
method Fine-grained hierarchical information from medical classification systems used to analyze over 33,000 covariates.
result Method has better predictive ability than pre-specified morbidity groups.
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…
We point out an issue with Theorem 5 appearing in "Group-based active query selection for rapid diagnosis in time-critical situations". Theorem 5 bounds the expected number of queries for a greedy algorithm to identify the class of an item within a constant factor of optimal. The Theorem is based on correctness of a re…
We empirically analyze the price and liquidity responses to trade signs, traded volumes and signed traded volumes. Utilizing the singular value decomposition, we explore the interconnections of price responses and of liquidity responses across the whole market. The statistical characteristics of their singular vectors …
Paper analyzes factors affecting COVID-19 risk in US counties.
problem Identifying factors influencing COVID-19 risk in US counties.
method Combines unsupervised (K-means clustering) and supervised learning models.
result Mean temperature, poverty, obesity, and other factors are most significant.
Complexity helps identify sparse risk factors in asset pricing.
problem Tension between feature richness and economic parsimony in high-dimensional asset pricing.
method Expanding feature space and using basis pursuit to discover sparse risk factors.
result Nonlinear feature expansions combined with basis pursuit yield superior out-of-sample performance.
The paper finds free semigroups in dense subgroups of Lie groups with critical exponents arbitrarily close to the subgroup's.
problem Finding free semigroups with critical exponents arbitrarily close to a subgroup's in dense subgroups of Lie groups.
method Analyzing Zariski dense discrete subgroups of Lie groups, showing the existence of free semigroups with critical exponents arbitrarily close to the subgroup's.
result The existence of free semigroups with critical exponents arbitrarily close to the subgroup's in dense subgroups of Lie groups.
This paper proposes a new HDP based online review rating regression model named Topic-Sentiment-Preference Regression Analysis (TSPRA). TSPRA combines topics (i.e. product aspects), word sentiment and user preference as regression factors, and is able to perform topic clustering, review rating prediction, sentiment ana…
Critical learning periods found in deep linear networks too.
problem Understanding why critical learning periods emerge in both biological and artificial networks.
method Focused on deep linear network models, analyzed depth and data distribution, and examined multi-task learning.
result Critical periods depend on model depth and data distribution structure, and pre-training can affect transfer performance.
This paper improves convergence bounds for AC and NAC algorithms with function approximation.
problem Improving convergence bounds for actor-critic algorithms with function approximation.
method Non-asymptotic analysis of AC and NAC algorithms with compatible function approximation.
result Eliminates the term ε_critic from the error bounds while maintaining best known sample complexities.
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.
CoRMF uses RNNs to solve Ising models efficiently by ordering critical edges.
problem Solving Ising models efficiently and accurately.
method Criticality-ordered spin sequence and RNNs for mean-field factorization.
result Proves tighter error bounds than naive mean-field.
Bayes factors and relative belief ratios are compared as measures of statistical evidence.
problem Which measure of evidence is more appropriate: Bayes factors or relative belief ratios?
method Comparison of Bayes factors and relative belief ratios, considering properties and restrictions.
result Relative belief ratio has better properties as a measure of evidence.
In the field of machine learning, it is still a critical issue to identify and supervise the learned representation without manually intervening or intuition assistance to extract useful knowledge or serve for the downstream tasks. In this work, we focus on supervising the influential factors extracted by the variation…
New definition of regular points for PL functions on manifolds.
problem Defining regular points for PL functions on combinatorial manifolds.
method Definition based on link of the point, stratification of Jacobi set, Stein factorization of Reeb space.
result Our definition of regularity is distinct from existing definitions.
AACC improves RL performance in changing environments.
problem Deterioration of RL performance in real-world tasks.
method Formalizes CMDPs, proposes AACC for contextual RL.
result AACC outperforms baselines in various simulated environments.
A new framework improves volatility forecasting for financial markets.
problem Static factor models fail to capture evolving volatility co-movements.
method Time-varying factor model integrating dynamic cross-sectional factors.
result Framework demonstrates strong performance in AI-driven models and pairs trading.
The study examines the generalization of Macro-AUC in multi-label learning, identifying label imbalance as a critical factor.
problem Theoretical understanding of Macro-AUC in multi-label learning is lacking.
method Characterization of generalization properties of learning algorithms based on surrogate losses w.r.t. Macro-AUC, identification of label imbalance as a critical factor.
result The widely-used univariate loss-based algorithm is more sensitive to label imbalance than pairwise and reweighted loss-based ones, implying worse performance.
Generative models improve causal effect estimation from observational data.
problem Estimating causal effects from observational data, especially when confounding factors are present.
method Proposes a progressive sequence of Variational Auto-Encoder models to learn underlying factors and causal effects.
result Empirical results show superior performance compared to state-of-the-art approaches.
The paper studies the loss landscape of regularized deep matrix factorization, revealing unique and sharp minimizers.
problem Understanding the loss landscape and minimizers of regularized deep matrix factorization problems.
method Theoretical analysis of ℓ2-regularized deep matrix factorization/deep linear network training problems with squared-error loss. result The unique end-to-end minimizer exists for all target matrices except for a set of Lebesgue measure zero.
FactorMiner discovers financial alpha factors with low redundancy.
problem Finding novel financial alpha factors in a vast search space.
method Modular Skill Architecture and Experience Memory to distill and guide exploration.
result FactorMiner constructs a diverse library of high-quality factors with competitive performance.
LLM forecasting benchmarks suffer from information leakage, which confounds model performance.
problem LLM forecasting benchmarks suffer from information leakage.
method A retrieval-augmented LLM forecaster observes only decision-time information.
result The full pipeline obtains a median monthly Spearman rank IC of +0.154.
Risk statistic is a critical factor not only for risk analysis but also for financial application. However, the traditional risk statistics may fail to describe the characteristics of regulator-based risk. In this paper, we consider the regulator-based risk statistics for portfolios. By further developing the propertie…
The behavior of many Bayesian models used in machine learning critically depends on the choice of prior distributions, controlled by some hyperparameters that are typically selected by Bayesian optimization or cross-validation. This requires repeated, costly, posterior inference. We provide an alternative for selecting…
An ADRC-incorporated SGD algorithm improves latent factor analysis speed and accuracy.
problem Slow convergence in standard SGD for HDI matrix analysis.
method Incorporates ADRC principles to refine historical and future learning error states.
result Empirically outperforms state-of-the-art LFA models in HDI matrix prediction.
Study examines persistence diagrams in machine learning, proposing permutation tests.
problem Understanding the power and limitations of persistence diagrams in machine learning.
method Carried out experiments on graph and shape data, proposed permutation tests for persistence diagrams.
result Persistence pairing shows significant improvement in various tasks, but the most critical values are most discriminative.
GANs improve event generation in physics experiments.
problem Improving statistical precision in event generation.
method Used generative adversarial networks (GANs) to generate events.
result GANs amplify the statistical precision of the training sample.
Dynamical-VAE learns causal dynamics from POMDPs using future information.
problem Learning accurate state representations from partial observations in POMDPs.
method Dynamical Variational Auto-Encoder (DVAE) with hindsight framework.
result DVAE uncovers causal graph more effectively than history-based methods.
Classifies critical complexes for embedding in 3-sphere.
problem Classifying minimal obstructions to embedding in 3-sphere.
method Combinatorial approach using reduction graphs and forest attachments.
result Exactly seven critical complexes identified.
Latent factor models (LFMs) such as matrix factorization achieve the state-of-the-art performance among various Collaborative Filtering (CF) approaches for recommendation. Despite the high recommendation accuracy of LFMs, a critical issue to be resolved is the lack of explainability. Extensive efforts have been made in…
NCPF model improves traffic data imputation with neural and tensor methods.
problem Pervasive missing data in traffic analysis due to sensor failures and gaps.
method Neural Canonical Polyadic Factorization (NCPF) integrating CP decomposition and deep learning.
result NCPF outperforms state-of-the-art baselines in urban traffic datasets.
This paper compares uncertainty estimation methods for deep learning in autonomous vehicles.
problem Ensuring safety in autonomous vehicles through accurate uncertainty quantification in deep learning models.
method A comparative survey of uncertainty quantification methods in deep neural networks.
result Different methods for uncertainty quantification in DNNs have advantages and downsides for specific AV tasks and types of uncertainty.