Graph theory criterion for Hodge theory to match linearly.
problem Matching nonlinear Hodge theory to linear on graphs.
method Minimizing edge potentials and solving nonlinear coclosed equations.
result Nonlinear selector agrees with Hodge projector on cactus graphs.
Cactus doodles are geometric objects derived from cactus groups.
problem Understanding geometric structures related to algebraic groups.
method Defining cactus doodles via local moves on plane curves and relating them to cactus groups.
result Established properties of cactus doodles and their connection to cactus groups.
Affine cactus groups are CAT(0) and hyperbolic.
problem Characterizing geometric properties of affine cactus groups.
method Analyzing CAT(0) and hyperbolic properties through group theory.
result Affine cactus groups of degree three are hyperbolic.
Explains the pure cactus group of degree three and its relation to four points on a circle.
problem Understanding the relationship between cactus groups and configuration spaces.
method Provides an explicit description of the pure cactus group of degree three and its connection to the configuration space of four points on a circle.
result Explicitly describes the relationship between the pure cactus group of degree three and the configuration space of four points on the circle.
Summary of pure cactus groups and circle points.
problem Understanding pure cactus groups and configuration spaces.
method Summarizes previous work on the topic.
result Summary of results from previous papers and thesis.
Presented a simple group presentation for degree four cactus group.
problem Presented a simple group presentation for the pure cactus group of degree four.
method Action on hyperbolic plane, Dirichlet polygon construction.
result Isomorphic to the fundamental group of connected sum of five real projective planes.
Cactus improves auto-regressive decoding speed without sacrificing quality.
problem Accelerating auto-regressive decoding while maintaining output quality.
method Formalizes speculative sampling as constrained optimization and proposes Cactus for controlled divergence from the verifier distribution.
result Empirically validated effectiveness across various benchmarks.
The main goal of this paper is a calculation of the integral (co)homology of the group of symmetric automorphisms of a free product. We proceed by giving a geometric interpretation of symmetric automorphisms via a moduli space of certain diagrams, which we name cactus products. To describe this moduli space a theory of…
The BNSR-invariants of a group G are a sequence Σ1(G)⊇Σ2(G)⊇⋯ of geometric invariants that reveal important information about finiteness properties of certain subgroups of G. We consider the symmetric automorphism group ΣAutn and pure symmetric automorphism group PΣAutn of the free…
Let M be a closed, oriented manifold of dimension d. Let LM be the space of smooth loops in M. Chas and Sullivan recently defined a product on the homology H∗(LM) of degree −d. They then investigated other structure that this product induces, including a Batalin -Vilkovisky structure, and a Lie algebra str…
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.
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…
It was proven by González-Meneses, Manchón and Silvero that the extreme Khovanov homology of a link diagram is isomorphic to the reduced (co)homology of the independence simplicial complex obtained from a bipartite circle graph constructed from the diagram. In this paper we conjecture that this simplicial complex is al…
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.
A widely applicable Bayesian information criterion (Watanabe, 2013) is applicable for both regular and singular models in the model selection problem. This criterion tends to overestimate the log marginal likelihood. We identify an overestimating term of a widely applicable Bayesian information criterion. Adjustment of…
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.
In the first part of the paper, we solve the boundary and monodromy problems for the isomonodromy equation of the n×n meromorphic linear system of ordinary differential equations with Poncaré rank 1. In particular, we derive an explicit expression of the Stokes matrices of the linear system, via the boundary …
In [D.A. Fedoseev, V.O. Manturov, A sliceness criterion for odd free knots,arXiv:1707.04923], the authors proved a sliceness criterion for odd free knots: free knots with odd chords. In the present paper we give a similar criterion for stably odd free knots. Some additional results on knot sliceness and cobordism are g…
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.
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.
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. 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.
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.
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.
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.
Paper proves a new criterion for time-like geodesics in flat spacetimes.
problem Existence and nature of time-like geodesics in asymptotically flat spacetimes.
method Generalized topological criterion using the Jordan-Brouwer Separation Theorem and differential geometry.
result Conclusively affirms the presence of time-like geodesics intersecting transversally.
Categorical d-separation criterion simplifies probability graph analysis.
problem Detecting causal relationships in probability distributions.
method Introducing categorical definitions for causal models and d-separation.
result Abstract version of d-separation criterion applies to various probability theories.
Physical systems are modelled and investigated within simulation software in an increasing range of applications. In reality an investigation of the system is often performed by empirical test scenarios which are related to typical situations. Our aim is to derive a method which generates diverse test scenarios each re…