New method uses algebraic trek criterion for model selection in linear structural equation models.
problem Deciding algebraic equivalence of linear structural equation models.
method Using the half-trek criterion to enumerate and compare constraints.
result Algebraic constraints improve model selection accuracy.
Gaussian graphical models are semi-algebraic subsets of the cone of positive definite covariance matrices. Submatrices with low rank correspond to generalizations of conditional independence constraints on collections of random variables. We give a precise graph-theoretic characterization of when submatrices of the cov…
TREK uses distillation to help students solve hard problems.
problem Stalled progress on hard prompts when current policy lacks useful reasoning trajectories.
method TREK combines distillation and reinforcement learning to expand student support.
result TREK significantly improves student performance on mathematical reasoning and agentic tasks.
New trekking approach reduces collisions in multi-player bandits.
problem Stochastic multi-armed bandits with many unknown players.
method Trekking approach to minimize collisions and regret.
result Guaranteed constant and sub-linear regret for static and dynamic scenarios.
Develops a method to identify causal effects in linear models with latent variables.
problem Identifying causal effects in models with latent variables that are not independent.
method A novel graphical criterion and an integer linear program algorithm.
result Sufficient condition for identifying causal effects by rational formulas in the covariance matrix.
IIC decouples causal identification into two phases, significantly reducing the HTC gap in linear SEMs.
problem Determining causal effect coefficients in linear SEMs with latent confounders using the Half-Trek Criterion (HTC) leaves a gap of inconclusive causal effects.
method Iterative Identification Closure (IIC) framework that decouples causal identification into two phases: a seed function S_0 and Reduced HTC propagation.
result IIC strictly subsumes both HTC and ancestor decomposition, reducing the HTC gap by over 80% with combined seeds.
The Trek Separation Theorem (Sullivant et al. 2010) states necessary and sufficient conditions for a linear directed acyclic graphical model to entail for all possible values of its linear coefficients that the rank of various sub-matrices of the covariance matrix is less than or equal to n, for any given n. In this pa…
New method learns graph structure with hidden causes from observational data.
problem Learning the structure of linear non-Gaussian models with hidden causes.
method Augments hidden variable structure by learning multidirected edges and uses higher order cumulants.
result Correct structure recovery for bow-free acyclic mixed graphs with multi-directed edges.
Unified causal models are formed from fragmented data sets.
problem Combining fragmented data sets to form a unified causal explanation is challenging.
method Using conditional independence properties of marginal datasets to reduce the number of possible models.
result Reduces the number of possible models to a unique one in some cases.
Study disproves a generalized numerical criterion for certain pairs.
problem Generalized numerical criterion for pairs
method Provided counterexamples
result Negative answer to the generalized numerical criterion problem
New polynomial criterion for periodic knots identified.
problem Identifying periodic knots efficiently.
method Examined HOMFLY-PT and Kauffman polynomials of periodic links.
result Criterion is stronger than existing methods.
Adjustment reduces bias in widely applicable Bayesian information criterion.
problem Overestimation of widely applicable Bayesian information criterion.
method Identified and adjusted an overestimating term in the criterion.
result Asymptotically unbiased estimator of log marginal likelihood.
New algorithms optimize a soft-robust criterion in reinforcement learning, reducing conservatism.
problem Computing robust policies for high-stakes decisions with limited data.
method Soft-robust criterion using risk measures, two algorithms for optimization.
result Our algorithms produce less conservative solutions than existing methods.
We introduce a new criterion to determine the order of an autoregressive model fitted to time series data. It has the benefits of the two well-known model selection techniques, the Akaike information criterion and the Bayesian information criterion. When the data is generated from a finite order autoregression, the Bay…
Modified Bakry-Émery criterion inequality for Tsallis entropy monotonicity.
problem Establishing improved logarithmic Sobolev inequalities and monotonicity of Tsallis entropy.
method Proving a one-parameter family of weighted Bakry-Émery Γ2 criterion inequalities and a modified inequality. result Yields a family of sharp Sobolev inequalities and monotonicity of Tsallis entropy.
The paper provides a sliceness criterion for stably odd knots.
problem Sliceness of stably odd knots
method Analyzes cobordisms and free knots to derive a sliceness criterion
result A sliceness criterion for stably odd knots
New criterion improves predictive evaluation in weighted inference scenarios.
problem Improving predictive evaluation in scenarios with different likelihoods for estimation and evaluation.
method Developed the posterior covariance information criterion (PCIC) to handle weighted likelihood inference.
result PCIC is asymptotically unbiased for quasi-Bayesian generalization error in weighted inference.
Criterion for stopping conjugacy class enumeration in triangle groups.
problem Enumerating all conjugacy classes in cocompact triangle groups.
method Encoding by P. Dehornoy and T. Pinsky; stopping criterion based on geometric length.
result Stopping criterion for the generation of conjugacy classes in cocompact triangle groups.
New criterion for solving inverse Hessian equations, including J-equation.
problem Existence of solutions to inverse Hessian equations, including J-equation.
method Stability of pairs in the sense of Paul, formulated in terms of GIT criterion.
result New numerical criterion for existence of solutions to inverse Hessian equations.
Criterion for nilpotent Lie groups to have nilsolitons.
problem Existence of nilsolitons in nilpotent Lie groups.
method Algebraic criterion for nilpotent Lie algebras, proving necessary and sufficient condition for nilsolitons.
result Criterion provides a necessary and sufficient condition for nilpotent Lie groups to admit nilsolitons.
Study proposes a stopping criterion for active learning based on error stability.
problem Improving predictive performance in active learning by adaptively annotating samples.
method Proposes a stopping criterion based on error stability for Bayesian active learning.
result Demonstrates the proposed criterion stops active learning at the appropriate timing for various models and datasets.
Clarifies boundary criterion for non-one-ended subgroups in cubulation theory.
problem Boundary criterion for relative cubulation in non-one-ended subgroups.
method Showed that if boundary criterion is satisfied for a relatively hyperbolic group, the group admits a relatively geometric action on a CAT(0) cube complex.
result The refinement of the boundary criterion is useful for constructing new relative cubulations.
Extends Kelly Criterion to more complex betting scenarios.
problem Maximizing long-term growth in complex betting models.
method Generalizes Kelly Criterion to Lévy processes and high-frequency limits.
result Improved strategies for high-frequency betting.
Derives criteria for Kähler structures on holomorphic submersions.
problem Criteria for Kähler structures on holomorphic submersions.
method Derives a criterion for Kähler structures using holomorphic submersions.
result Proves Kähler structures for certain holomorphic submersions.
Partial answer to affineness of entire Grauert tubes, with Stein manifold criterion.
problem Affineness of entire Grauert tubes
method Generalized Demailly's criterion for Stein manifolds
result Complement of a codimension-one subset is affine
Optimizes recommendation models using skew normal distribution.
problem Improving personalized recommendation systems.
method Develops a new optimization criterion based on skew normal distribution.
result Significantly outperforms state-of-the-art models.
Criterion for solvability of complex 2-Hessian equation on compact Kähler manifolds.
problem Solvability of complex 2-Hessian equation on compact Kähler manifolds.
method Nakai--Moishezon-type criterion associated with the complex 2-Hessian equation.
result Criterion equivalent to existence of a smooth 2-admissible representative in complex dimension three.
Paper explains why small-loss criterion works for learning from noisy labels.
problem Learning from noisy labels in deep learning with limited labeled data.
method Theoretical analysis and reformulation of the small-loss criterion.
result Theoretical explanation and reformulation of the small-loss criterion.
New criterion assesses cluster separability for validation.
problem Validating cluster analysis results and determining the number of clusters.
method Distinguishability criterion, combined loss function-based framework.
result Validated cluster configurations and determined the number of clusters.
The study provides a criterion for solving complex Hessian-type equations on projective manifolds.
problem Solving complex Hessian-type equations on projective manifolds.
method Proving Nakai-Moishezon-type criteria for these equations.
result Uniform criteria for solving these equations, including complex Hessian and Hessian quotient equations.
Criterion found for Teichmüller extremal maps on infinite Riemann surfaces.
problem Finding necessary and sufficient conditions for Teichmüller extremal maps.
method Established a criterion for Teichmüller-type extremal maps.
result Criterion for Teichmüller extremal maps on infinite Riemann surfaces.
This paper proves a Nakai-Moishezon criterion for complex Hessian equations.
problem The solvability of complex Hessian equations on Kähler manifolds.
method Establishing a Nakai-Moishezon criterion for Kähler classes on analytic Kähler varieties.
result Proves Lejmi-Szekelyhidi's conjecture for the J-equation. The study provides a criterion to compute the total Thurston-Bennequin invariant of Legendrian graphs.
problem Computing the total Thurston-Bennequin invariant for Legendrian graphs.
method Generalized criterion for computing the total Thurston-Bennequin invariant from the tb of smaller cycles.
result The criterion holds for graphs with up to 9 vertices and for infinite families of examples.
Criterion for subgroup separability in outer automorphism groups.
problem Subgroup separability in outer automorphism groups.
method Criterion for separability of subgroups.
result Strengthening and generalizing a previous result on mapping class groups.
Paper proposes an algorithm for robust estimation using Huber's criterion.
problem Non-convexity and non-robustness of joint maximum likelihood estimation.
method Block-wise minimization majorization framework with data-adaptive step sizes.
result Improved convergence and robustness in sparse learning.
Extends Milnor's criterion to biharmonic functions.
problem Deciding surface type for biharmonic functions.
method Generalizes Milnor's criterion to biharmonic functions.
result Characterizes whether a surface is hyperbolic or parabolic for biharmonic functions.
Counterexample disproves Masur's criterion in Thurston metric.
problem Disproving Masur's criterion in Teichmüller space with Thurston metric.
method Constructing a minimal, filling, non-uniquely ergodic lamination and showing a geodesic stays in the thick part.
result Masur's criterion does not hold in the Thurston metric.
Sharpness of Tian's K-stability criterion demonstrated through specific examples.
problem Determining the exact conditions for K-stability in Fano varieties.
method Constructing specific Fano varieties to test Tian's criterion's limits.
result Tian's criterion is sharp; there are Fano varieties meeting the criterion that are not K-polystable.
New infill criterion identifies local optima in multimodal models.
problem Identify challenging test scenarios for physical systems.
method Model-based optimization with efficient global optimization and infill criterion.
result New infill criterion outperforms existing methods in identifying local optima.
This paper integrates Kelly's Criterion into portfolio optimization models.
problem Incorporating Kelly's Criterion into standard portfolio optimization models.
method Developed a model combining risk and return, solved using differential evolution algorithm.
result Evolutionary algorithms can solve portfolio optimization problems with Kelly's Criterion.
New proof of Kobayashi's properness criterion using metric geometry.
problem Properness of L-action on homogeneous spaces. method CAT(0) metric geometry on non-compact Riemannian symmetric spaces.
result Established a similar criterion for properness of L-action on homogeneous spaces. A new criterion for deep active learning selects minimal labeled data points.
problem Efficiently select minimal labeled data points for deep neural networks.
method Diffuses label information over a graph of data representations to switch between exploration and refinement.
result The diffusion-based criterion outperforms existing methods in deep active learning.
Study introduces combinatorial criterion for quasi-isometry groups of Euclidean spaces.
problem Determining quasi-isometries of Euclidean spaces.
method Introduces PLδ-homeomorphisms and combinatorial criterion using vertices and edges of simplicial structures. result The center of the quasi-isometry group QI(Rn) is trivial. We obtain a constructive criterion for robust no-arbitrage in discrete-time market models with transaction costs. This criterion is expressed in terms of the supports of the regular conditional upper distributions of the solvency cones. We also consider the model with a bank account. A method for construction of arbitr…
Study shows the corrected Akaike criterion is inadmissible for estimating Kullback-Leibler discrepancy.
problem Inadmissibility of the corrected Akaike information criterion for estimating Kullback-Leibler discrepancy.
method Loss estimation framework to demonstrate inadmissibility and provide improved estimators.
result Improved estimators of Kullback-Leibler discrepancy are provided and perform well in reduced-rank situations.
New inequality criterion for a mean field equation on spheres.
problem Finding uniqueness in a mean field equation on spheres.
method Established a new Moser-Trudinger-Onofri inequality with a constraint on moments deviation.
result A threshold for deviation is a uniqueness criterion for the mean field equation.
In this paper, we investigate the geometry of a general class of gradient flows with multiple local maxima. we decompose the underlying space into disjoint regions of attraction and establish the adjacency criterion. The criterion states a necessary and sufficient condition for two regions of attraction of stable equil…
This work improves fair tensor decomposition using a kernel criterion.
problem Learning fair low-rank tensor decompositions with statistical parity.
method Regularizes Canonical Polyadic Decomposition with KHSIC to ensure approximate statistical parity.
result The proposed algorithm achieves better fairness and fit than state-of-the-art FATR.