Improves BCFW for SSVM optimization with adaptive sampling and caching.
problem Optimizing SSVM objective using BCFW algorithm.
method Adaptive gap-based sampling, pairwise and away-step Frank-Wolfe, cache-hit criterion for oracle calls, regularization path computation.
result First method to compute approximate SSVM regularization paths.
Parrot learns optimal cache replacement policies using imitation learning.
problem Improving cache hit rates in complex access patterns.
method Imitation learning approach using Belady's oracle policy.
result Parrot increases cache hit rates by 61% on a web search benchmark.
RLCache uses reinforcement learning to optimize cache management decisions.
problem Optimizing cache hit rate and storage size in computer systems.
method Designing three reinforcement learning agents for cache manager tasks and two advanced architectures.
result Reinforcement learning agents achieve higher cache hit rates and minimize storage space compared to heuristics.
Freezing intermediate layers reduces DNN inference latency.
problem High latency in deep learning inference due to computationally expensive models.
method Introduce approximate caching at each intermediate layer to avoid running all layers for many inference requests.
result Reduces the number of effective layers by half for 91.58% of CIFAR-10 requests.
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.
New criterion improves domain adaptation performance.
problem Binary classification in a target domain with unlabeled data and domain shift.
method Introduces a generalized Neyman-Pearson criterion for optimal domain adaptation.
result Stronger domain adaptation results possible with new criterion.
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.
New criterion ensures recovery of latent factors in NMF with mild conditions.
problem Identifying latent factors in nonnegative matrix factorization (NMF) under mild conditions.
method Proposed a new identification criterion based on the scatteredness of one factor's rows in the nonnegative orthant.
result Latent factors can be provably identified from the NMF model with minimal structural assumptions.
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.
New method improves regression models by optimizing correntropy with variable center.
problem Improving regression models by optimizing correntropy with variable center.
method Proposed a new optimization criterion called Maximum Correntropy Criterion with Variable Center (MCC-VC) and an efficient approach to optimize kernel width and center location.
result Simulation results show desirable performance of the new method.