Study compares different complexity criteria for free boundary minimal surfaces.
problem Comparing different complexity criteria for free boundary minimal surfaces.
method Global theory of free boundary minimal surfaces.
result Provides a complete picture of how area, topology, and Morse index compare.
We present criteria for establishing a triangulation of a manifold. Given a manifold M, a simplicial complex A, and a map H from the underlying space of A to M, our criteria are presented in local coordinate charts for M, and ensure that H is a homeomorphism. These criteria do not require a differentiable structure, or…
Criteria for embedding simplicial complexes into manifolds, reducing a topological problem to algebra.
problem Embedding simplicial complexes into manifolds.
method Interplay between geometric topology, combinatorics, and linear algebra; calculation of generators in configuration space homology.
result Criteria for Z2-embeddability of certain simplicial complexes to 2k-dimensional manifolds. This work compares data reduction criteria for online Gaussian Processes.
problem The computational complexity of Gaussian Processes limits their applicability to small datasets and streaming scenarios.
method Unified comparison of several data reduction criteria, analyzing computational complexity and reduction behavior.
result Practical guidelines for choosing a suitable data reduction criterion for online Gaussian Processes.
A game-theoretic approach to multi-criteria ranking from ordinal data.
problem Ranking objects from ordinal data with multiple criteria.
method Generalizing von Neumann winner to multi-criteria setting using Blackwell's approachability.
result The Blackwell winner can be computed as a convex optimization problem and achieves near-optimal sample complexity.
Establishing criteria for top cell inertness in complexes.
problem Criteria for top cell inertness in Poincaré duality complexes.
method Algebraic intersection theory, homotopy fibrations, surgery, homogeneous spaces.
result Established various criteria for top cell inertness.
We give local criteria for smooth non-embeddablity of Levi-flat manifolds. For this purpose, we pose an analogue of Ueda theory on the neighborhood structure of hypersurfaces in complex manifolds with topologically trivial normal bundles.
Study proves Kählerness criteria for Hermitian surfaces under specific curvature conditions.
problem Determining when Hermitian surfaces are Kählener.
method Used explicit identities linking Strominger-Bismut Ricci curvatures to torsion, and Chern number identities.
result Proves several Kählerness criteria for compact Hermitian surfaces.
The paper explores criteria for positivity of forms and proves their strong positivity in specific cases.
problem Understanding positivity of exterior forms on complex vector spaces.
method Dimensionality reduction and criteria based on Hermitian matrices.
result Strong positivity of certain forms proven by duality.
The paper proposes criteria and methods for evaluating and aggregating feature-based model explanations.
problem Lack of quantitative evaluation criteria for feature-based model explanations.
method Developed quantitative evaluation criteria (low sensitivity, high faithfulness, low complexity), devised a framework for aggregation, and derived a new aggregate Shapley value explanation function.
result A new aggregate Shapley value explanation function that minimizes sensitivity.
New criteria for relative hyperbolicity in hierarchically hyperbolic spaces.
problem Characterizing relative hyperbolicity in hierarchically hyperbolic spaces.
method New formulation of relative hyperbolicity in terms of hierarchy structures, applied to graphs associated to surfaces.
result The separating curve graph of a surface is relatively hyperbolic when the surface has zero or two punctures.
New quantity helps map homotopy classes in complex spaces.
problem Understanding homotopic classes of maps between complex spaces.
method Identified a new monotone quantity in mean curvature flows of maps between Riemannian manifolds.
result Sharp criteria for homotopic classes of maps between complex projective spaces and spheres.
Many machine learning frameworks, such as resource-allocating networks, kernel-based methods, Gaussian processes, and radial-basis-function networks, require a sparsification scheme in order to address the online learning paradigm. For this purpose, several online sparsification criteria have been proposed to restrict …
New method speeds up model selection for complex scientific tasks.
problem Exhaustive model selection is computationally infeasible for large model spaces.
method Branch-and-bound algorithm with non-monotonic criteria.
result Guaranteed identification of optimal models with significant computational speedups.
Criteria for lifting manifold diffeomorphisms to vector bundle automorphisms.
problem Lifting diffeomorphisms to vector bundles.
method Criteria for lifting diffeomorphisms to linear automorphisms of vector bundles.
result Criteria for lifting diffeomorphisms to linear automorphisms of vector bundles.
The paper introduces a new model selection criterion for various time series models.
problem Designing adaptive model selection criteria for a wide range of time series models.
method The approach involves a penalized contrast akin to Hannan and Quinn's criterion, with a data-driven calibrated term.
result The new criteria select the true model almost surely asymptotically for a wide range of time series models.
New criteria distinguish cause from effect in data, overcoming statistical limitations.
problem Determining causal direction from statistical dependence alone.
method Intuitive criteria based on simplicity of prediction, tested on synthetic data.
result Criteria accurately distinguish cause from effect in various scenarios.
Model selection based on classical information criteria, such as BIC, is generally computationally demanding, but its properties are well studied. On the other hand, model selection based on parameter shrinkage by ℓ1-type penalties is computationally efficient. In this paper we make an attempt to combine their st…
The paper sets criteria for no arbitrage in complex financial models.
problem Determining conditions for the absence of arbitrage in financial markets.
method Established deterministic conditions for no arbitrage, NUPBR, and NFLVR in diffusion market models.
result Provided criteria in terms of scale function and speed measure.
New method for sorting with interacting criteria using value functions and convex programming.
problem Learning models for sorting with interacting criteria.
method Additive piecewise-linear value function, convex quadratic programming, regularization, classification methods.
result The proposed method outperforms classical methods in sorting tasks.
Solves complex Hessian equations in unstable cases, proving unique canonical solutions with singularities.
problem Existence of smooth solutions to complex Hessian equations in unstable cases.
method Parabolic flows and moment-map energy functionals, focusing on J-equation and deformed Hermitian Yang-Mills equation.
result Proves existence of unique canonical solutions with singularities on Kahler surfaces.
The relation between nilmanifolds with left-invariant complex structure and iterated principal holomorphic torus bundles is clarified and we give criteria under which deformations in the large are again of such type. As an application we obtain a fairly complete picture in complex dimension three.
Testing two potentially multivariate variables for statistical dependence on the basis finite samples is a fundamental statistical challenge. Here we explore a family of tests that adapt to the complexity of the relationship between the variables, promising robust power across scenarios. Building on the distance correl…
The paper explores coalescent contractions in contractible spaces, providing criteria and examples.
problem Existence and absence of coalescent contractions in contractible spaces.
method Analysis of contractible finite simplicial complexes and criteria for coalescent contractions.
result Criteria for contractible finite simplicial complexes that ensure no coalescent contractions.
The paper proves embedding conditions for complexes in manifolds using matrix rank criteria.
problem Embedding k-dimensional simplicial complexes into (k−1)-connected PL manifolds. method Proves embedding conditions using a skew-symmetric matrix with low rank over Q. result Embedding conditions for k-complexes in 2k-manifolds are equivalent to low-rank matrix conditions. This work compares lattice-free and lattice-based training criteria for LVCSR.
problem Improving acoustic model performance in speech recognition.
method Direct comparison of lattice-free and lattice-based sequence discriminative training criteria using GPU.
result Lattice-free MMI performance is comparable to lattice-based criteria, while lattice-based sMBR remains superior.
Framework selects real estate redevelopment uses by integrating value, risk, complexity, and irreversibility.
problem Persistent underperformance of real estate assets due to structural misalignment.
method Integrates real-options logic and multi-criteria decision analysis.
result Reduces over-complexification and misalignment in strategic use selection.
We introduce linear Dirac and generalized complex structures on Cartan geometries and give criteria for Dirac subalgebras of $\frkg\ltimes\frkg^*$ representing Dirac structures on a Cartan geometry. We prove that there is a bijection between the linear generalized structures on a torsion free Cartan geometry and the eq…
We investigate modular embeddings for semi-arithmetic Fuchsian groups. First we prove some purely algebro-geometric or even topological criteria for a regular map from a smooth complex curve to a quaternionic Shimura variety to be covered by a modular embedding. Then we set up an adelic formalism for modular embeddings…
In generalized complex geometry, we revisit linear subspaces and submanifolds that have an induced generalized complex structure. We give an expression of the induced structure that allows us to deduce a smoothness criteria, we dualize the results to submersions and we make a few comments on generalized complex mapping…
We give some general criteria of being a homeomorphism for continuous mappings of topological manifolds, as well as criteria of being a diffeomorphism for smooth mappings of smooth manifolds. As an illustration, we apply these criteria to the problems arising in two- and three-dimensional grid generation.
We give criteria for real, complex and quaternionic representations to define s-representations, focusing on exceptional Lie algebras defined by spin representations. As applications, we obtain the classification of complex representations whose second exterior power is irreducible or has an irreducible summand of co-d…
The paper proves a numerical condition for solving complex Hessian quotient equations with Calabi symmetry.
problem Solvability of complex Hessian quotient equations with specific symmetry.
method Proving a numerical condition and proposing a conjecture on existence of k-subharmonic representatives. result Numerical condition ensures solvability of complex Hessian quotient equations.
The study reveals flaws in pruning criteria and proposes a new assumption for better filter selection.
problem Flaws in existing pruning criteria for CNNs.
method Empirical experiments and Convolutional Weight Distribution Assumption.
result The Convolutional Weight Distribution Assumption improves filter selection in pruning.
New method finds optimal hyperparameters for multiple tasks and criteria.
problem Finding optimal hyperparameters for multiple tasks and criteria.
method Multi-Task Multi Criteria (MTMC) method that provides Pareto-optimal solutions.
result The method selects optimal hyperparameters based on given criteria significance coefficients.
Improved recommendations using latent embeddings from user reviews.
problem Lack of consideration for latent embeddings in multi-criteria recommender systems.
method Utilized variational autoencoders to map user reviews into latent embeddings, which are then compressed into discrete vectors for multi-criteria recommendation.
result The proposed method significantly outperforms baselines across various datasets and evaluation measures.
New model handles complex non-linear relationships with hidden graph structures.
problem Modeling non-linear relationships with hidden graph-structured interactions.
method Block-diagonal localized mixture of polynomial experts (BLoMPE) regression model with penalized maximum likelihood selection criterion.
result Strong theoretical guarantee for finite-sample oracle inequality.
New criteria for Heegaard splittings ensure strong irreducibility and finite Goeritz groups.
problem Determining strong irreducibility and finite Goeritz groups of Heegaard splittings.
method Two diagrammatic criteria for Heegaard splittings, accepting arbitrary disk systems.
result Criteria ensure strong irreducibility and finite Goeritz groups for Heegaard splittings.
This work is motivated by two problems: 1) The approach of manifolds and spaces by triangulations. 2) The complexity growth in sequences of polyhedra. Considering both problems as related, new criteria and methods for approximating smooth manifolds are deduced. When the sequences of polyhedra are obtained by the action…
New cross-validation methods for Gaussian process regression with efficient gradient computation.
problem Estimating parameters of Gaussian process covariance functions.
method Derive new cross-validation criteria and efficient adjoint computation of gradients.
result Efficient method for evaluating cross-validation criteria and their gradients.
Develops scenario theory for multi-criteria decision making.
problem Need for robustness assessment with multiple criteria and datasets.
method Collectively treats risks associated with individual criteria for multi-criteria decision problems.
result More accurate robustness certificates and sharper quantification of simultaneous criterion satisfaction.
We consider the problem of identifying patterns in a data set that exhibit anomalous behavior, often referred to as anomaly detection. In most anomaly detection algorithms, the dissimilarity between data samples is calculated by a single criterion, such as Euclidean distance. However, in many cases there may not exist …
The paper evaluates criteria for selecting cryptocurrencies based on historical data.
problem High risk of cryptocurrencies due to volatility.
method Characterized returns and risks using historical data in short time windows (7 and 15 days). Analyzed the importance of criteria using various methods.
result Importance of criteria for selecting cryptocurrencies is analyzed and evaluated.
Consistent model selection for spiked Wigner model via AIC-type criteria.
problem Estimating the number of spiked eigenvalues in the spiked Wigner model.
method AIC-type model selection criteria with parameters γ.
result Strong consistency for γ > 2 and weak consistency for γ = 2 + δ_N.
Study Lie algebroid connections on principal bundles over complex projective varieties.
problem Existence and properties of Lie algebroid connections on principal bundles.
method Definition and study of Lie algebroid valued connections on holomorphic principal G-bundles, investigation of existence criteria.
result Investigation of criteria for existence of Lie algebroid connections on principal G-bundles over smooth complex projective curves.
When sufficient labeled data are available, classical criteria based on Receiver Operating Characteristic (ROC) or Precision-Recall (PR) curves can be used to compare the performance of un-supervised anomaly detection algorithms. However , in many situations, few or no data are labeled. This calls for alternative crite…
The paper analyzes performance criteria for competing fund managers in Ito-diffusion markets.
problem Analyzing performance of competing fund managers in Ito-diffusion markets.
method Developed forward relative performance criteria and forward Nash equilibrium for passive and competitive cases.
result Extended performance criteria for investment problems in Ito-diffusion markets.
Paper defines numerical criteria to test handlebody link irreducibility.
problem Determining the irreducibility of handlebody links.
method A set of numerical criteria to test handlebody links for irreducibility.
result Effective method to recognize irreducibility of handlebody knots and most handlebody links.