We inspect Vietoris-Rips complexes of certain metric spaces using a new generalization of Bestvina-Brady discrete Morse theory. Our main result is a pair of metric criteria on , called the Morse Criterion and Link Criterion, that allow us to deduce information about the homotopy types of certain $VR_t(…
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,695 papers · 148 categories
Trend · papers per month
48 results for “group information criterion”
Proposes a group-splicing algorithm for efficient BSGS in high-dimensional settings.
problem Efficiently selecting a small part of non-overlapping groups for best interpretability in high-dimensional settings.
method Iteratively detects relevant groups and excludes irrelevant ones using a novel group information criterion.
result Certifiable polynomial-time algorithm for identifying the optimal subset of groups with high probability.
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…
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.
Improves Group Lasso for categorical data by reducing dimensionality and selecting models.
problem Sparse modelling of categorical data is challenging, especially for high dimensions.
method Two-step procedure: first, reduce dimensionality using Group Lasso; second, select final model using an information criterion on clustered levels.
result The method produces a sparse solution and performs better than state-of-the-art algorithms in prediction accuracy and model dimension.
Calibrating sufficientlystat.ML
Calibrating classifiers reduces grouping loss using sufficiency criteria.
problem Grouping loss in probabilistic classifier calibration is often overlooked.
method Revisited Langford & Zadrozny's probing reduction approach and introduced Brier curves.
result The probing reduction approach reduces grouping loss and supports sufficient calibration.
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…
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.
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.
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.
Proposes a new hyperprior and predictive criterion for weakly informative hyperprior in relevance vector machine.
problem Capturing non-homogeneous data structure with limited kernel functions.
method Uses inverse gamma hyperprior with a shape parameter close to zero and a scale parameter not close to zero. Applies multiple kernel method with different widths. Proposes extended predictive information criterion for scale parameter selection.
result Obtains a multiple kernel relevance vector regression model with good predictive accuracy.
SIC detects elbows in error curves automatically.
problem Automatic elbow detection in error curves.
method Spectral information criterion (SIC) extracts geometric features of error curves.
result SIC provides a subset of models with smaller cardinality than total possible models.
A group of transition probability functions form a Shannon's channel whereas a group of truth functions form a semantic channel. By the third kind of Bayes' theorem, we can directly convert a Shannon's channel into an optimized semantic channel. When a sample is not big enough, we can use a truth function with paramete…
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.
Complete criterion for VoI in multi-decision influence diagrams established.
problem Analyzing safety and fairness properties of AI systems using influence diagrams.
method Introduced ID homomorphisms and Tree of Systems to prove properties of multi-decision influence diagrams.
result First complete graphical criterion for VoI in influence diagrams with multiple decisions.
In the information-based paradigm of inference, model selection is performed by selecting the candidate model with the best estimated predictive performance. The success of this approach depends on the accuracy of the estimate of the predictive complexity. In the large-sample-size limit of a regular model, the predicti…
Orders and Fiberingmath.GR
Simpler proof for Kielak's virtual fibering criterion.
problem Virtual fibering criterion for RFRS groups
method Simpler proof
result Simplified proof of Kielak's criterion
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.
LS improves model selection for singular statistical models.
problem Challenges in model selection for singular statistical models.
method Integrates empirical loss from WAIC and sBIC penalty term.
result Enhanced utility for model selection without regularity constraints.
SplitWise enhances stepwise regression by adaptively encoding numeric predictors into binary features.
problem Capturing nonlinear relationships in regression models without sacrificing interpretability.
method Adaptive encoding of numeric predictors into binary features using shallow decision trees, assessed by AIC or BIC.
result Consistently produces more parsimonious and generalizable models than traditional techniques.
An Analysis of the Value of Information when Exploring Stochastic, Discrete Multi-Armed Banditscs.AI
In this paper, we propose an information-theoretic exploration strategy for stochastic, discrete multi-armed bandits that achieves optimal regret. Our strategy is based on the value of information criterion. This criterion measures the trade-off between policy information and obtainable rewards. High amounts of policy …
Study introduces combinatorial criterion for quasi-isometry groups of Euclidean spaces.
problem Determining quasi-isometries of Euclidean spaces.
method Introduces -homeomorphisms and combinatorial criterion using vertices and edges of simplicial structures.
result The center of the quasi-isometry group is trivial.
We consider a problem of grouping multiple graphs into several clusters using singular value thesholding and non-negative factorization. We derive a model selection information criterion to estimate the number of clusters. We demonstrate our approach using "Swimmer data set" as well as simulated data set, and compare i…
A new criterion selects models in overparameterized settings.
problem Model selection for overparameterized models with more parameters than data.
method Establishes Bayesian duality and introduces the Interpolating Information Criterion.
result The Interpolating Information Criterion selects models in overparameterized settings.
Uniform criterion for vanishing products in bounded cohomology.
problem Vanishing of cup products and Massey products in bounded cohomology.
method Uniform vanishing criterion for products in bounded cohomology.
result Reproved and extended previous vanishing results.
If an augmented algebra K over Q is filtered by powers of its augmentation ideal I, the associated graded algebra grK need not in general be quadratic: although it is generated in degree 1, its relations may not be generated by homogeneous relations of degree 2. In this paper we give a sufficient criterion (called the …
Criterion for surfaces in Heisenberg group to be graphs using flat cones.
problem Characterizing surfaces in Heisenberg group as graphs.
method Using planar cones to define intrinsic rectifiability.
result Criterion for topological surfaces to be intrinsic Lipschitz graphs.
A new criterion HBIC improves model selection for factor analysis with missing data.
problem Model selection for factor analysis with incomplete data.
method Proposes a novel criterion HBIC that uses actual observed information in the penalty term.
result HBIC is more accurate than BIC when missing data rates are high.
New proof of Kobayashi's properness criterion using metric geometry.
problem Properness of -action on homogeneous spaces.
method CAT(0) metric geometry on non-compact Riemannian symmetric spaces.
result Established a similar criterion for properness of -action on homogeneous spaces.
New criterion for bi-ordering free groups under automorphisms.
problem Bi-ordering free groups under automorphisms.
method New criterion for bi-ordering free groups.
result Fundamental group of the magic manifold is bi-orderable.
Criterion for lifting smooth contact maps between Carnot groups to central extensions.
problem Existence of smooth contact map lifts between Carnot groups and their central extensions.
method Criterion using pullbacks and Lie algebra cohomology classes.
result Necessary and sufficient conditions for lifting are formulated.
We give a criterion in terms of the boundary for the existence of a proper cocompact action of a word-hyperbolic group on a CAT(0) cube complex. We describe applications towards lattices and hyperbolic 3-manifold groups. In particular, by combining the theory of special cube complexes, the surface subgroup result of Ka…
We give a combinatorial criterion that implies both the non-strong relative hyperbolicity and the one-endedness of a finitely generated group. We use this to show that many important classes of groups do not admit a strong relatively hyperbolic group structure and have one end. Applications include surface mapping clas…
A group of transition probability functions form a Shannon's channel whereas a group of truth functions form a semantic channel. Label learning is to let semantic channels match Shannon's channels and label selection is to let Shannon's channels match semantic channels. The Channel Matching (CM) algorithm is provided f…
New criteria for non-isometric group actions in metric spaces.
problem Understanding group actions on non-isometric spaces.
method Generalizing results from isometric to continuous group actions.
result Criterion for cocompact cyclic groups to be inessential.
Statistical inference is considered for variables of interest, called primary variables, when auxiliary variables are observed along with the primary variables. We consider the setting of incomplete data analysis, where some primary variables are not observed. Utilizing a parametric model of joint distribution of prima…
Framework for generating multiple clusterings from multi-view data.
problem Challenges in finding optimal clustering criteria and handling incomplete multi-view data.
method DiMVMC framework that optimizes multiple decoder deep networks to complete data views and generate shared representations.
result DiMVMC outperforms state-of-the-art competitors in generating multiple clusterings with high diversity and quality.
Criterion for polystability in Lie group actions on manifolds.
problem Characterizing orbits intersecting a specific set in Lie group actions.
method Hilbert-Mumford criterion applied to polystability, using Cartan decomposition and gradient maps.
result Characterization of orbits intersecting a specific set in terms of maximal weight functions.
Criterion for periodic orbits convergence proved.
problem Periodic orbits convergence criterion.
method Criterion for Benjamini-Schramm convergence of periodic orbits of Lie groups.
result Criterion for periodic orbits convergence proved.
In this paper we give a criterion for pairs of isometries of a nonpositively curved metric space to generate a free group. This criterion holds only in singular spaces, for example in Euclidean buildings. The original motivation for our criterion was to prove that the four dimensional Burau representation is faithful. …
We give very flexible, concrete constructions of discrete and faithful epresentations of right-angled Artin groups into higher-rank Lie groups. Using the geometry of the associated symmetric spaces and the combinatorics of the groups, we find a general criterion for when discrete and faithful representations exist, and…
This paper introduces Kernel-based Information Criterion (KIC) for model selection in regression analysis. The novel kernel-based complexity measure in KIC efficiently computes the interdependency between parameters of the model using a variable-wise variance and yields selection of better, more robust regressors. Expe…
Feature selection aims to select the smallest feature subset that yields the minimum generalization error. In the rich literature in feature selection, information theory-based approaches seek a subset of features such that the mutual information between the selected features and the class labels is maximized. Despite …
The paper derives an equation linking WAIC and WBIC for singular models.
problem In singular models, conventional criteria fail due to likelihood and posterior breakdown.
method Theoretical derivation linking WAIC and WBIC.
result An asymptotic equation linking WAIC and WBIC for singular models.
A simple application of FIC to model selectionphysics.data-an
We have recently proposed a new information-based approach to model selection, the Frequentist Information Criterion (FIC), that reconciles information-based and frequentist inference. The purpose of this current paper is to provide a simple example of the application of this criterion and a demonstration of the natura…
We test three common information criteria (IC) for selecting the order of a Hawkes process with an intensity kernel that can be expressed as a mixture of exponential terms. These processes find application in high-frequency financial data modelling. The information criteria are Akaike's information criterion (AIC), the…
Criterion for realizing groups on Enriques manifolds.
problem Realizing groups on Enriques manifolds.
method Using recent developments in Birman-Hilden theory and Nielsen realization for hyper-Kähler manifolds.
result Numerical criterion for realizing groups on Enriques manifolds.
Entropy-Norm space for geometric selection of strict Nash equilibria in n-person gamesphysics.soc-ph
Proposes a new criterion for selecting Nash equilibria considering both utility and inequality.
problem Finding a fair Nash equilibrium in group decision-making.
method Introduces entropy-norm space for geometric selection of strict Nash equilibria.
result The closest entropy-norm pair to the largest entropy-norm pair in rescaled space is the most suitable equilibrium.