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

Trend · papers per month

145290434579 · Jun 202019922001200920172026
48 results for linear extension

Yu. I. Merzljakov developed a method of splittable coordinates which helps to verify the linearity of some groups, he established some fundamental results using this method. In this paper we use the method of splittable coordinates and find some sufficient condition under which the semi--direct product of two linear gr…

2005-06-07abs ↗pdf ↗

We provide an example of a zero-dimensional compact metric space XX and its closed subspace AA such that there is no continuous linear extension operator for the Lipschitz pseudometrics on AA to the Lipschitz pseudometrics on XX. The construction is based on results of A. Brudnyi and Yu. Brudnyi concerning linear e…

2004-08-15abs ↗pdf ↗

XGBoost is often presented as the algorithm that wins every ML competition. Surprisingly, this is true even though predictions are piecewise constant. This might be justified in high dimensional input spaces, but when the number of features is low, a piecewise linear model is likely to perform better. XGBoost was exten…

2017-10-10abs ↗pdf ↗

Introduces fat Lie theory for Lie groupoids and algebroids.

problem Representation theory of Lie groupoids and algebroids.
method Introduces fat extensions and abstract 2-term representations up to homotopy (ruths). Establishes correspondences and equivalences.
result One-to-one correspondence between fat extensions and abstract 2-term representations up to homotopy.

We present a geometric construction of central extensions of covering groups of the group of volume preserving diffeomorphisms, integrating central extensions of the Lie algebra of divergence free vector fields defined by Lichnerowicz cocycles. Certain covering spaces of non-linear Grassmannians can be realized as preq…

2010-07-31abs ↗pdf ↗

We generalize the prequantization central extension of a group of diffeomorphisms preserving a closed 2-form ω(ω-invariant diffeomorphisms) to an abelian extension of a group of diffeomorphisms preserving a closed vector valued 2-form ω, up to a linear isomorphism (ω-equivariant diffeomorphisms). Every abelian extensio…

2009-10-20abs ↗pdf ↗

We compare various extensions of the Bradley-Terry model and a hierarchical Poisson log-linear model in terms of their performance in predicting the outcome of soccer matches (win, draw, or loss). The parameters of the Bradley-Terry extensions are estimated by maximizing the log-likelihood, or an appropriately penalize…

2018-07-04abs ↗pdf ↗

PatternLocal improves XAI for non-linear models by suppressing suppressor variables.

problem Suppressor variables cause false-positive feature attributions in non-linear models.
method PatternLocal uses locally linear surrogate models and transforms weights into a generative representation.
result PatternLocal reduces false-positive attributions and provides more reliable explanations.

In this paper, we present a novel approach to construct multiclass classifiers by means of arrangements of hyperplanes. We propose different mixed integer (linear and non linear) programming formulations for the problem using extensions of widely used measures for misclassifying observations where the \textit{kernel tr…

2018-10-22abs ↗pdf ↗

We classify all of the 4-dimensional linear Poisson structures of which the corresponding Lie algebras can be considered as the extension by a derivation of 3-dimensional unimodular Lie algebras. The affine Poisson structures on R^3 are totally classified.

2007-07-19abs ↗pdf ↗

Paper describes how to extend multiple conjugation quandles using maps.

problem Understanding affine extensions of multiple conjugation quandles.
method Introduces augmented MCQ Alexander pairs for affine extensions.
result Affine extensions of multiple conjugation quandles can be described by quadruples of maps.

In a regression setup with deterministic design, we study the pure aggregation problem and introduce a natural extension from the Gaussian distribution to distributions in the exponential family. While this extension bears strong connections with generalized linear models, it does not require identifiability of the par…

2009-11-16abs ↗pdf ↗

Linear mixed models (LMMs) are used extensively to model dependecies of observations in linear regression and are used extensively in many application areas. Parameter estimation for LMMs can be computationally prohibitive on big data. State-of-the-art learning algorithms require computational complexity which depends …

2018-03-12abs ↗pdf ↗

Extending braid group representations to singular braid monoids and groups.

problem Extending braid group representations to singular braid monoids and groups.
method Investigating the extension of representations from braid groups to singular braid monoids and groups, and computing defects.
result Constructing a linear representation of the singular braid group that is an extension of the Lawrence-Krammer-Bigelow representation and computing its defect.

Extends covariance estimation with multiple targets for better performance.

problem Improving covariance estimation for multiple targets.
method Combines multiple constant matrices with sample covariance matrix, derives estimators and proves convergence.
result The multi-target linear shrinkage estimator outperforms other estimators in various situations.

The min-max kernel is a generalization of the popular resemblance kernel (which is designed for binary data). In this paper, we demonstrate, through an extensive classification study using kernel machines, that the min-max kernel often provides an effective measure of similarity for nonnegative data. As the min-max ker…

2015-03-05abs ↗pdf ↗

Can we effectively learn a nonlinear representation in time comparable to linear learning? We describe a new algorithm that explicitly and adaptively expands higher-order interaction features over base linear representations. The algorithm is designed for extreme computational efficiency, and an extensive experimental …

2014-10-02abs ↗pdf ↗

Clustering is an extensive research area in data science. The aim of clustering is to discover groups and to identify interesting patterns in datasets. Crisp (hard) clustering considers that each data point belongs to one and only one cluster. However, it is inadequate as some data points may belong to several clusters…

2018-08-01abs ↗pdf ↗

Paper extends Chernoff sampling for active testing and parameter estimation, improving neural network and regression models.

problem Reducing sample complexity in hypothesis testing and model parameter estimation.
method Developed an extension of Chernoff sampling for active learning and parameter estimation.
result Non-asymptotic bounds for sample complexity and estimation error in active learning.

The kernel least mean squares (KLMS) algorithm is a computationally efficient nonlinear adaptive filtering method that "kernelizes" the celebrated (linear) least mean squares algorithm. We demonstrate that the least mean squares algorithm is closely related to the Kalman filtering, and thus, the KLMS can be interpreted…

2013-10-20abs ↗pdf ↗

We tackle permutation in linear regression with a new inference framework.

problem Statistical investigation of permutation in linear regression models.
method Localization step followed by conditional Monte Carlo test and coefficient inference.
result Valid statistical inference procedures for permutation and regression coefficients.

We give necessary and sufficient conditions of the existence of a left-invariant metric of strictly negative Ricci curvature on a solvable Lie group the nilradical of whose Lie algebra g\mathfrak{g} is a filiform Lie algebra n\mathfrak{n}. It turns out that such a metric always exists, except for in the two cases, wh…

2015-01-09abs ↗pdf ↗

Submodular extensions of an energy function can be used to efficiently compute approximate marginals via variational inference. The accuracy of the marginals depends crucially on the quality of the submodular extension. To identify the best possible extension, we show an equivalence between the submodular extensions of…

2018-01-10abs ↗pdf ↗

We show that certain classes of graphs of free groups contain surface subgroups, including groups with positive b2b_2 obtained by doubling free groups along collections of subgroups, and groups obtained by "random" ascending HNN extensions of free groups. A special case is the HNN extension associated to the endomorphi…

2012-12-11abs ↗pdf ↗

A-MMSE uses attention to learn efficient OFDM channel estimation.

problem Accurate OFDM channel estimation requires second-order statistics, which are hard to obtain in practice.
method A-MMSE is a model-based DNN framework that learns linear MMSE filters via Attention Transformer, reducing inference complexity.
result A-MMSE outperforms other methods in normalized MSE across various SNR conditions.

Algorithm adapts to non-stationary rewards without prior knowledge.

problem Optimizing decisions in non-stationary environments without prior knowledge of changes.
method Optimization-based algorithm that restarts when non-stationarity is detected.
result Achieves tighter dynamic regret bound and is nearly minimax optimal.

We present a general formalism for incorporating the string corrections in generalised geometry, which necessitates the extension of the generalised tangent bundle. Not only are such extensions obstructed, string symmetries and the existence of a well-defined effective action require a precise choice of the (generalise…

2014-07-28abs ↗pdf ↗

We prove an extension of a theorem of Barta then we make few geometric applications. We extend Cheng's lower eigenvalue estimates of normal geodesic balls. We generalize Cheng-Li-Yau eigenvalue estimates of minimal submanifolds of the space forms. We prove an stability theorem for minimal hypersurfaces of the Euclidean…

2003-08-11abs ↗pdf ↗