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

Trend · papers per month

80161241321 · Jun 202019922001200920172026
48 results for high-dimensional groups

New findings show mapping class groups of certain high-dimensional manifolds are not residually finite.

problem Understanding the mapping class groups of simply connected high-dimensional manifolds.
method Provided a counterexample showing mapping class groups are not residually finite.
result Mapping class groups of some high-dimensional manifolds are not residually finite.

GTBO uses group testing to optimize high-dimensional functions efficiently.

problem Challenges in optimizing high-dimensional, expensive functions due to the curse of dimensionality.
method GTBO combines testing and optimization phases to identify active variables and guide efficient optimization.
result GTBO outperforms state-of-the-art methods on high-dimensional optimization tasks.

Study on high-dimensional solid tori reveals infinite generation in their diffeomorphism groups.

problem Infinite generation in the homotopy groups of high-dimensional solid tori diffeomorphisms.
method Analysis of homotopy fibre of a linearisation map from the plus-construction of the classifying space of certain space of self-embeddings of stabilisations of the manifold to a form of Hermitian K-theory of the integral group ring of π1(S1).
result Homotopy groups of diffeomorphisms of high-dimensional solid tori are infinite in certain degrees.

Classifies hyperbolic manifolds with specific automorphism groups.

problem Classifying Kobayashi-hyperbolic manifolds with high-dimensional automorphism groups.
method Analyzes manifolds of dimension n2n \ge 2 with automorphism groups of dimensions n27n^2 - 7 or n28n^2 - 8.
result Completes the classification for automorphism groups n27n^2 - 7 and n28n^2 - 8.

New groups algebraically fibre with high-dimensional hyperbolic groups.

problem Finding new quasi-isometry classes of hyperbolic groups.
method Constructing infinitely many hyperbolic groups as finite-index subgroups of right-angled Coxeter groups.
result Groups algebraically fibre with finitely presented kernels, expanding finiteness properties.

GCAO improves clustering of high-dimensional data by grouping low-density boundary points.

problem Stability and accuracy of clustering in high-dimensional, non-uniform data.
method Group-level optimization with gravitational attraction and optimization.
result GCAO outperforms 11 clustering methods on multiple datasets.

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.

GTBO uses group testing to optimize high-dimensional functions efficiently.

problem Optimizing expensive, high-dimensional functions with limited data.
method Group testing to identify active dimensions, then guide optimization.
result GTBO outperforms state-of-the-art methods on high-dimensional benchmarks.

Paper develops a new estimator for high-dimensional panel data with common shocks.

problem Cross-sectionally dependent errors driven by common shocks in high-dimensional panel data.
method Factor-augmented sparse-group LASSO estimator combining MIDAS aggregation with latent factors.
result The estimator outperforms standard LASSO for prediction and estimation in settings with cross-sectional dependence.

We explicitly classify all pairs (M,G)(M,G), where MM is a connected complex manifold of dimension n2n\ge 2 and GG is a connected Lie group acting properly and effectively on MM by holomorphic transformations and having dimension dGd_G satisfying n2+2dG<n2+2nn^2+2\le d_G<n^2+2n. These results extend -- in the complex case -- the…

2006-10-10abs ↗pdf ↗

The homotopy theory of gauge groups has received considerable attention in recent decades. In this work, we study the homotopy theory of gauge groups over some high dimensional manifolds. To be more specific, we study gauge groups of bundles over (n1)(n-1)-connected closed 2n2n-manifolds, the classification of which was …

2018-05-13abs ↗pdf ↗

Clustering aims to divide a set of points into groups. The current paradigm assumes that the grouping is well-defined (unique) given the probability model from which the data is drawn. Yet, recent experiments have uncovered several high-dimensional datasets that form different binary groupings after projecting the data…

2019-09-14abs ↗pdf ↗

New theorem for generalized group sparsity improves consistency and convergence rates.

problem Improving statistical inference in high-dimensional data with element-wise and group-wise sparsity.
method Developed a generalized version of Sparse-Group Lasso and proved a universal theorem for consistency and convergence rates.
result Obtained results on consistency and convergence rates for different forms of double sparsity regularization.

Develops methods for selecting and estimating smooth functional coefficients in high-dimensional multivariate functional data.

problem Functional predictor selection and estimation of smooth functional coefficients in high-dimensional multivariate functional data.
method Functional group-sparse regression methods in a generic Hilbert space of infinite dimension.
result Consistency of estimation and selection (oracle property) under infinite-dimensional Hilbert spaces.

The paper triangulates Heisenberg groups with horizontal and straight simplexes.

problem Triangulating Heisenberg groups with specific regularity properties.
method Constructing triangulations with horizontal and straight simplexes on a polyhedral structure and extending to the whole Heisenberg group.
result Explicit examples of grid and triangulations provided.

Improves robustness of high-dimensional regression with rank objective and group lasso regularization.

problem Heavy-tailed noise and outliers in high-dimensional regression.
method Non-smooth Wilcoxon score based rank objective, group lasso regularization, data-driven tuning rule, proximal augmented Lagrangian method.
result Robust estimator with finite-sample error bound and efficient computational method.

Paper detects and estimates breaks in high-dimensional functional time series.

problem Detecting and estimating structural breaks in heterogeneous mean functions of high-dimensional functional time series.
method Proposes a new test statistic combining functional CUSUM and power enhancement components, with a clustering algorithm for group structure estimation.
result The proposed techniques have satisfactory performance in finite samples, detecting and estimating breaks effectively.

Proposes a two-stage method for selecting correlated predictors in high-dimensional data.

problem Selecting correlated predictors in high-dimensional data with unknown group structures.
method Two-stage approach: variable clustering followed by group selection.
result The two-stage method improves prediction accuracy and active predictor selection.

Screening is the problem of finding a superset of the set of non-zero entries in an unknown p-dimensional vector β* given n noisy observations. Naturally, we want this superset to be as small as possible. We propose a novel framework for screening, which we refer to as Multiple Grouping (MuG), that groups variables, pe…

2012-08-09abs ↗pdf ↗

The sparse group lasso optimization problem is solved using a coordinate gradient descent algorithm. The algorithm is applicable to a broad class of convex loss functions. Convergence of the algorithm is established, and the algorithm is used to investigate the performance of the multinomial sparse group lasso classifi…

2012-05-06abs ↗pdf ↗

Given a hyperbolic knot KK and any n2n\geq 2 the abelian representations and the holonomy representation each give rise to an (n1)(n-1)-dimensional component in the SL(n,C)\operatorname{SL}(n,\Bbb{C})-character variety. A component of the SL(n,C)\operatorname{SL}(n,\Bbb{C})-character variety of dimension n\geq n is called high-d…

2016-10-14abs ↗pdf ↗

PROBE algorithm efficiently solves sparse high-dimensional linear regression.

problem Sparse high-dimensional linear regression models with complex parameter spaces.
method Partitioned empirical Bayes ECM algorithm for computationally efficient MAP estimation.
result PROBE algorithm provides robust and efficient coordinate-wise optimization.

Develops MGQDA for multi-group classification with theoretical guarantees and practical applications.

problem Complex multi-group classification problems with nonlinear decision boundaries and group-specific covariance patterns.
method MGQDA, a method based on quadratic discriminant analysis that projects predictors onto a lower-dimensional subspace.
result MGQDA achieves competitive or improved predictive performance compared to existing methods.

In this paper, we recall Quillen's plus construction for high-dimensional smooth manifolds and the solution to the group extension problem. We then develop a geometric procedure due for producing a "reverse" to the plus construction, a one-sided s-cobordism called a semi-s-cobordism, when the total group of the group e…

2015-02-15abs ↗pdf ↗

Develops a hybrid MtFA approach for high-dimensional data clustering.

problem Scalability issues in traditional MtFA estimation methods for high-dimensional data.
method Integrates profile likelihood method into EM framework for efficient parameter estimation.
result Demonstrates superior computational efficiency and clustering accuracy compared to existing methods.

Proposes a neural network framework for feature selection in high-dimensional settings.

problem Challenges in feature selection and non-linear function estimation in high-dimensional settings.
method Sparse-input neural networks using group concave regularization.
result Establishes finite-sample guarantees for variable selection consistency and prediction accuracy.

For a complex projective space the inertia group, the homotopy inertia group and the concordance inertia group are isomorphic. In complex dimension 4n+1, these groups are related to computations in stable cohomotopy. Using stable homotopy theory, we make explicit computations to show that the inertia group is non-trivi…

2015-10-09abs ↗pdf ↗

Sparsity learning with known grouping structure has received considerable attention due to wide modern applications in high-dimensional data analysis. Although advantages of using group information have been well-studied by shrinkage-based approaches, benefits of group sparsity have not been well-documented for greedy-…

2017-07-10abs ↗pdf ↗

We investigate the existence of homotopy comoment maps (comoments) for high-dimensional spheres seen as multisymplectic manifolds. Especially, we solve the existence problem for compact effective group actions on spheres and provide explicit constructions for such comoments in interesting particular cases.

2019-06-20abs ↗pdf ↗

We determine all connected homogeneous Kobayashi-hyperbolic manifolds of dimension n4n\ge 4 whose group of holomorphic automorphisms has dimension either n24n^2-4, or n25n^2-5, or n26n^2-6. This paper continues a series of articles that achieve classifications for automorphism group dimension n23n^2-3 and greater.

2018-05-05abs ↗pdf ↗

We present a rigidity theorem for the action of the mapping class group π0(Diff(M))π_0(\mathrm{Diff}(M)) on the space R+(M)\mathcal{R}^+(M) of metrics of positive scalar curvature for high dimensional manifolds MM. This result is applicable to a great number of cases, for example to simply connected 66-manifolds and high dimensi…

2019-12-18abs ↗pdf ↗

Unified framework for high-dimensional bandit problems with low-dimensional structures.

problem Stochastic high-dimensional bandit problems with low-dimensional structures.
method Proposed a simple unified algorithm and a general analysis framework for the regret upper bound.
result Unified algorithm achieves comparable regret bounds in various high-dimensional bandit problems.

Exclusive Lasso improves survival prediction in cancer datasets.

problem Enhanced survival prediction in cancer datasets with high-dimensional genomic and clinical data.
method Proposes Exclusive Lasso regularization for feature selection in Cox regression models for grouped variables.
result Demonstrates improved survival prediction performance using Exclusive Lasso compared to standard Cox regression.

S-DIDML integrates structural DID with ML for causal inference in high-dimensional data.

problem Causal inference in high-dimensional observational panel data with confounding variables.
method Structural identification with high-dimensional estimation, Neyman orthogonality, cross-fitting, causal forests, semi-parametric models.
result Precision in identifying policy-sensitive groups and optimizing resource allocation.

Robust methods for high-dimensional linear learning improve performance under heavy-tailed distributions and outliers.

problem Efficient learning in high-dimensional settings with robustness to outliers and heavy-tailed data.
method Two algorithms depending on gradient-Lipschitz loss function, applied to sparse, group-sparse, and low-rank matrix recovery.
result Achieved near-optimal estimation rates under heavy-tails and outliers, with computational cost comparable to non-robust methods.

SDAMI enhances interpretable high-dimensional regression with sparse deep learning and footprint principle.

problem Personalized models for small samples and high-dimensional features with interpretability.
method Sparse Deep Additive Model with Interactions (SDAMI) combining sparsity-driven feature selection and deep subnetworks.
result SDAMI successfully identifies pure interactions with near-zero false positive rates.