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

25.0%50.0%75.0%100.0% · Feb 199419922001200920172026
48 results for Hidden Subgroup Problem

The paper offers simple, near-optimal algorithms for multi-group learning.

problem Learning predictors within subgroups of a population, addressing fairness and hidden stratification.
method Studies the structure of solutions and provides simple, near-optimal algorithms.
result Simple and near-optimal algorithms for multi-group learning.

Hidden symmetry of a G'-space X is defined by an extension of the G'-action on X to that of a group G containing G' as a subgroup. In this setting, we study the relationship between the three objects: (A) global analysis on X by using representations of G (hidden symmetry); (B) global analysis on X by using representat…

2016-08-30abs ↗pdf ↗

Quantum Fourier Transform aids machine learning inference.

problem Generalizing from finite data samples to ground truth.
method Inspired by quantum algorithms, uses Quantum Fourier Transform to expose invariant subspace for data comparison.
result Proposes a concrete implementation for machine learning applications leveraging symmetries.

This paper continues our exploration of homology cobordism of 3-manifolds using our recent results on Cheeger-Gromov rho-invariants associated to amenable representations. We introduce a new type of torsion in 3-manifold groups we call hidden torsion, and an algebraic approximation we call local hidden torsion. We cons…

2011-01-21abs ↗pdf ↗

AdaptHetero uses MLI to tailor EHR models for subgroup-specific predictions.

problem Lack of subgroup-specific, operationalizable modeling strategies in EHRs.
method Integrates MLI with unsupervised clustering to identify subgroup-specific characteristics.
result Improves predictive performance by up to 174.39 percent across many subpopulations.

The hidden M-algebra is integrated into a super-Lie group, allowing for compactification of extra dimensions.

problem Integrating the hidden M-algebra into a super-Lie group to model super-exceptional spacetimes.
method Left-invariant extension of the decomposed M-theory 3-form, providing a computer-checked re-derivation and streamlined conception of super-Lie groups.
result Lattice subgroups of the hidden M-group allow toroidal compactification of hidden dimensions, akin to topological T-duality.

A serious problem in learning probabilistic models is the presence of hidden variables. These variables are not observed, yet interact with several of the observed variables. Detecting hidden variables poses two problems: determining the relations to other variables in the model and determining the number of states of …

2013-01-10abs ↗pdf ↗

We consider high-dimensional regression over subgroups of observations. Our work is motivated by biomedical problems, where disease subtypes, for example, may differ with respect to underlying regression models, but sample sizes at the subgroup-level may be limited. We focus on the case in which subgroup-specific model…

2016-11-03abs ↗pdf ↗

Consider a relatively hyperbolic group G. We prove that if G is finitely presented, so are its parabolic subgroups. Moreover, a presentation of the parabolic subgroups can be found algorithmically from a presentation of G, a solution of its word problem, and generating sets of the parabolic subgroups. We also give an a…

2010-10-06abs ↗pdf ↗

We present a non-parametric Bayesian approach to structure learning with hidden causes. Previous Bayesian treatments of this problem define a prior over the number of hidden causes and use algorithms such as reversible jump Markov chain Monte Carlo to move between solutions. In contrast, we assume that the number of hi…

2012-06-27abs ↗pdf ↗

We define a Hidden Markov Model (HMM) in which each hidden state has time-dependent activity levels\textit{activity levels} that drive transitions and emissions, and show how to estimate its parameters. Our construction is motivated by the problem of inferring human mobility on sub-daily time scales from, for example, mobile phone …

2015-07-27abs ↗pdf ↗

The paper solves the conjugacy problem in a specific braid group quotient and finds infinite virtually cyclic subgroups.

problem Solving the conjugacy problem in the Artin braid group quotient Bn/[Pn,Pn]B_n/[P_n,P_n].
method Using systems of equations over the integers derived from the action of Bn/[Pn,Pn]B_n/[P_n,P_n] on the abelianization of Pn/[Pn,Pn]P_n/[P_n,P_n]. Also, explicitly realizing infinite virtually cyclic subgroups.
result Explicitly realized infinite virtually cyclic subgroups in Bn/[Pn,Pn]B_n/[P_n,P_n].

Randomly chosen primary hidden units and derived secondary units reduce neural network complexity.

problem Large number of hidden units in neural networks.
method Introducing primary and secondary hidden units with random weights for primary units and derived weights for secondary units.
result Significant reduction in the number of hidden units without compromising accuracy.

Paper tackles decidability of subgroup discreteness problem.

problem Decidability of finitely generated subgroup discreteness in PSL(2,R)PSL(2,\mathbb{R}) and PSL(2,C)PSL(2,\mathbb{C}).
method Examines different computational models to determine if the discreteness problem is decidable.
result The answer depends on the model of computation chosen.

Reduces field theories on principal bundles by a subgroup, deriving reduced equations.

problem Hamiltonian field theories on principal G-bundles with invariant densities.
method Lie-Poisson reduction using covariant bracket formulation.
result Derives reduced observables, brackets, and equations of motion for field theories.

We provide an algorithm to solve the word problem in all fundamental groups of closed 3-manifolds; in particular, we show that these groups are autostackable. This provides a common framework for a solution to the word problem in any closed 3-manifold group using finite state automata. We also introduce the notion of a…

2016-09-20abs ↗pdf ↗

Multilabel classification is an important problem in a wide range of domains such as text categorization and music annotation. In this paper, we present a probabilistic model, Multilabel Logistic Regression with Hidden variables (MLRH), which extends the standard logistic regression by introducing hidden variables. Hid…

2019-12-03abs ↗pdf ↗

The paper tackles fairness in forecasting and learning linear dynamical systems.

problem Under-representation bias in training data for multiple subgroups.
method Introducing subgroup-fair and instant-fair learning of LDS from multiple trajectories of varying lengths, using hierarchies of convexifications of non-commutative polynomial optimisation problems.
result Empirical results show both the beneficial impact of fairness considerations on statistical performance and encouraging effects of exploiting sparsity on run time.

This paper is concerned with the sparsification of the input-hidden weights of ELM (Extreme Learning Machine). For ordinary feedforward neural networks, the sparsification is usually done by introducing certain regularization technique into the learning process of the network. But this strategy can not be applied for E…

2018-01-22abs ↗pdf ↗

In this paper, we show that for every abelian subgroup HH of a Garside group, some conjugate g1Hgg^{-1}Hg consists of ultra summit elements and the centralizer of HH is a finite index subgroup of the normalizer of HH. Combining with the results on translation numbers in Garside groups, we obtain an easy proof of the a…

2006-09-25abs ↗pdf ↗

Study on generalisation in random feature learning and hidden manifold models.

problem Generalisation in high-dimensional learning problems.
method Replica method from statistical physics for asymptotic generalisation performance.
result Closed-form expression for generalisation performance in various high-dimensional settings.

We show that any subgroup of a (virtually) nilpotent-by-polycyclic group satisfies the bounded packing property of Hruska-Wise. In particular, the same is true about metabelian groups and linear solvable groups. However, we find an example of a finitely generated solvable group of derived length 3 which admits a finite…

2014-08-11abs ↗pdf ↗

The muti-layer information bottleneck (IB) problem, where information is propagated (or successively refined) from layer to layer, is considered. Based on information forwarded by the preceding layer, each stage of the network is required to preserve a certain level of relevance with regards to a specific hidden variab…

2017-11-14abs ↗pdf ↗

Researchers find a way to bound the complexity of certain subgroup geometric invariants.

problem Understanding the geometric invariants of subgroups of direct products of free groups.
method Generalizing techniques for 'pushing fillings' into normal subgroups.
result Finitely presented subgroups of direct products of three free groups and subgroups of finiteness type Fn1\mathcal{F}_{n-1} in a direct product of nn free groups have Dehn functions bounded above by N9N^9.

We prove that the conjugacy problem in right-angled Artin groups (RAAGs), as well as in a large and natural class of subgroups of RAAGs, can be solved in linear-time. This class of subgroups contains, for instance, all graph braid groups (i.e. fundamental groups of configuration spaces of points in graphs), many hyperb…

2008-02-13abs ↗pdf ↗

New method for causal effect estimation with hidden confounders.

problem Estimating causal effects in the presence of hidden confounders.
method Singular value decomposition of a conditional expectation operator followed by saddle-point optimization.
result Our method outperforms existing methods on common benchmarks.

The paper solves the Nielsen realization problem for high degree del Pezzo surfaces.

problem Which finite subgroups of the mapping class group of a del Pezzo surface lift to the diffeomorphism group?
method Classification and partial answers for d7d \geq 7, equivariant connected sum for d=6d = 6.
result Complete classification for d7d \geq 7, partial answer for d=6d = 6.

We study the congruence problem for subgroups of the modular group that appear as Veech groups of square-tiled surfaces in the minimal stratum of abelian differentials of genus two.

2004-10-28abs ↗pdf ↗

New algorithm tackles subgroup fairness in AI with multiple sensitive attributes.

problem Heavy computational burdens and data sparsity in subgroup fairness for multiple sensitive attributes.
method Doubly Regressing Adversarial learning (DRAF) for subgroup fairness, focusing on subgroups with sufficient sample sizes and marginal fairness.
result DRAF algorithm reduces a surrogate fairness gap for supIPM with less computation than directly reducing supIPM.

Paper introduces a new method to compute pseudoinverse for ELM with large datasets.

problem Efficient computation of pseudoinverse for ELM with large datasets.
method Rank-based matrix decomposition of the hidden layer matrix.
result Optimal training time and reduced computational complexity for large hidden nodes.

New method estimates hidden binary mixture model centers efficiently.

problem Estimating centers in high-dimensional binary mixture models with hidden Markov structure.
method Proposes a minimax optimal procedure and an adaptive variant.
result Achieves optimal rate of order δd/n+d/n\sqrt{δd/n} + d/n.