Research
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,694 papers · 148 categories

Trend · papers per month

110221331441 · Jun 202019922001200920172026
48 results for Takeuchi Information Criterion

The paper explores methods to construct knots with diffeomorphic 00-traces.

problem Constructing knots with diffeomorphic 00-traces.
method Survey of Gompf-Miyazaki's dualizable pattern, Abe-Jong-Omae-Takeuchi's band presentation, and RGB-diagram.
result A sufficient condition for two knots obtained by Abe-Jong-Omae-Takeuchi's method to coincide.

We prove that an isoparametric hypersurface with four principal curvatures and multiplicity pair (7,8)(7,8) is either the one constructed by Ozeki and Takeuchi, or one of the two constructed by Ferus, Karcher, and Münzner. This completes the classification of isoparametric hypersurfaces in spheres that É. Cartan initiated…

2016-05-03abs ↗pdf ↗

In this sequel, employing more commutative algebra than that explored in \cite{CCJ}, we show that an isoparametric hypersurface with four principal curvatures and multiplicities (3,4)(3,4) in S15S^{15} is one constructed by Ozeki-Takeuchi \cite[I]{OT} and Ferus-Karcher-Münzner \cite{FKM}, referred to collectively as of OT-…

2010-02-06abs ↗pdf ↗

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…

2015-08-11abs ↗pdf ↗

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.

Ozeki and Takeuchi \cite[I]{OT} introduced the notion of Condition A and Condition B to construct two classes of inhomogeneous isoparametric hypersurfaces with four principal curvatures in spheres, which were later generalized by Ferus, Karcher and Münzner to many more examples via the Clifford representations; we will…

2009-07-02abs ↗pdf ↗

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.

The classification of isoparametric hypersurfaces with four principal curvatures in spheres in [2] hinges on a crucial characterization, in terms of four sets of equations of the 2nd fundamental form tensors of a focal submanifold, of an isoparametric hypersurface of the type constructed by Ferus, Karcher and Münzner. …

2008-03-09abs ↗pdf ↗

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.

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.

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.

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.

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…

2014-08-25abs ↗pdf ↗

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…

2015-06-19abs ↗pdf ↗

When the in-sample Sharpe ratio is obtained by optimizing over a k-dimensional parameter space, it is a biased estimator for what can be expected on unseen data (out-of-sample). We derive (1) an unbiased estimator adjusting for both sources of bias: noise fit and estimation error. We then show (2) how to use the adjust…

2016-02-19abs ↗pdf ↗

Develops higher arity VC theory and characterizes PAC learning in product spaces.

problem Characterizing PAC learning in multi-dimensional product spaces.
method Introduces higher arity VC dimension, generalizes Haussler packing lemma, and develops hypergraph regularity lemma.
result Characterizes higher arity PAC learning in n-fold product spaces.

Complex hyperbolic triangle groups were first considered by Mostow in building the first nonarithmetic lattices in PU(2, 1). They are a natural generalization of the classical triangle groups acting on the hyperbolic plane. A well-known theorem of Takeuchi is that there are only finitely many Fuchsian triangle groups t…

2011-09-12abs ↗pdf ↗

We study tick-by-tick financial returns belonging to the FTSE MIB index of the Italian Stock Exchange (Borsa Italiana). We can confirm previously detected non-stationarities. However, scaling properties reported in the previous literature for other high-frequency financial data are only approximately valid. As a conseq…

2012-12-03abs ↗pdf ↗

A new method for automatic gradient tree boosting using information theory.

problem Automatic selection of tree complexity and number in gradient boosting.
method Optimism of greedy leaf splitting procedure modeled as a Cox-Ingersoll-Ross process, leading to an information criterion for model selection.
result The method achieves significant speedups (10-1400) compared to xgboost without sacrificing predictive power.

Paper introduces NICc for fast cluster-based validation of prediction models.

problem Validation of prediction models on clustered data.
method Derived NICc to approximate leave-one-cluster-out deviance for standard regression models.
result NICc provides more accurate model size and variable selection, especially with strong clustering.

Comparing with traditional learning criteria, such as mean square error (MSE), the minimum error entropy (MEE) criterion is superior in nonlinear and non-Gaussian signal processing and machine learning. The argument of the logarithm in Renyis entropy estimator, called information potential (IP), is a popular MEE cost i…

2017-10-11abs ↗pdf ↗

The paper describes a method to infer the signal-to-noise ratio in portfolio optimization.

problem Estimating the signal-to-noise ratio in portfolio optimization problems.
method A statistic similar to the Sharpe Ratio Information Criterion is used for inference.
result The method works well for reasonable sample and asset universe sizes.

Accurate model selection is a fundamental requirement for statistical analysis. In many real-world applications of graphical modelling, correct model structure identification is the ultimate objective. Standard model validation procedures such as information theoretic scores and cross validation have demonstrated poor …

2019-08-27abs ↗pdf ↗

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.

We consider a problem of data integration. Consider determining which genes affect a disease. The genes, which we call predictor objects, can be measured in different experiments on the same individual. We address the question of finding which genes are predictors of disease by any of the experiments. Our formulation i…

2016-10-03abs ↗pdf ↗

Active learning aims to train a classifier as fast as possible with as few labels as possible. The core element in virtually any active learning strategy is the criterion that measures the usefulness of the unlabeled data based on which new points to be labeled are picked. We propose a novel approach which we refer to …

2017-06-23abs ↗pdf ↗

A statistical model or a learning machine is called regular if the map taking a parameter to a probability distribution is one-to-one and if its Fisher information matrix is always positive definite. If otherwise, it is called singular. In regular statistical models, the Bayes free energy, which is defined by the minus…

2012-08-31abs ↗pdf ↗

IIC provides a PAC-Bayes bound for interpolating models, revealing factors affecting generalization.

problem Theoretical challenges in understanding overparameterized models and their performance.
method PAC-Bayesian perspective applied to the Interpolating Information Criterion (IIC).
result Test error for overparameterized models achieving zero training error depends on various factors.