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

119238356475 · Jun 202019922001200920172026
48 results for Linear actions

A free action of a finite group on an odd-dimensional sphere is said to be almost linear if the action restricted to each cyclic or 2-hyperelementary subgroup is conjugate to a free linear action. We begin this survey paper by reviewing the status of almost linear actions on the 3-sphere. We then discuss almost linear …

1999-11-17abs ↗pdf ↗

This paper discusses topological and locally linear actions of finite groups on S4S^4. Local linearity of the orientation preserving actions on S4S^4 forces the group to be a subgroup of SO(5)SO(5). On the other hand, orientation reversing topological actions of "exotic" groups GG (i.e. G⊄O(5)G\not\subset O(5)) on S4S^4 are …

2014-12-18abs ↗pdf ↗

The symplectic group Sp(2g,Z) is a subgroup of the linear group SL(2g,Z) and admits a faithful action on the sphere S^(2g-1), induced from its linear action on Euclidean space R^(2g). Generalizing corresponding results for linear groups, we show that, if m < 2g-1 and g > 2, any continuous action of Sp(2g,Z) on a homolo…

2009-03-17abs ↗pdf ↗

Method predicts future rewards from past actions in a linear Gaussian system.

problem Maximizing cumulative reward in a stochastic multi-armed bandit with linear Gaussian dynamics.
method Proposes a method using a modified Kalman filter to predict future rewards based on past rewards.
result Reward from any action can be used to predict another action's future reward.

We consider locally linear Z_p x Z_p actions on the four-sphere. We present simple constructions of interesting examples, and then prove that a given action is concordant to its linear model if and only if a single surgery obstruction taking to form of an Arf invariant vanishes. We discuss the behavior of this invarian…

2005-11-08abs ↗pdf ↗

S.Bauer and M.Furuta defined a stable cohomotopy refinement of the Seiberg-Witten invariants. In this paper, we prove a vanishing theorem of Bauer-Furuta invariants for 4-manifolds with smooth Z/2-actions. As an application, we give a constraint on smooth Z/2-actions on homotopy K3#K3, and construct a nonsmoothable loc…

2007-05-11abs ↗pdf ↗

Lower bounds on eigenspectrum show rich action spaces force polynomial regret in linear bandits.

problem Understanding the minimum eigenvalue growth in linear bandits with rich action sets.
method Non-asymptotic lower bound on eigenspectrum of design matrix.
result Minimum eigenvalue of expected design matrix grows as Ω(n)Ω(\sqrt{n}) for sub-linear regret.

Researchers classify quotients of lens spaces using linear actions and topological tools.

problem Classifying quotients of lens spaces under linear actions of (Z/p)2(\mathbb{Z}/p)^2.
method Postnikov towers and surgery theory.
result Quotients are classified up to homotopy by kk-invariants and up to homeomorphism by Pontrjagin classes.

TOFU-POV tackles partially observed linear bandits, achieving sublinear regret with low-dimensional action vectors.

problem Stochastic linear bandits with partially observed actions in settings like recommendation and healthcare.
method TOFU-POV estimates latent action subspace, imputes missing actions, and runs OFUL in low-dimensional coordinates.
result TOFU-POV achieves T\sqrt{T} regret scaling with intrinsic subspace dimension, improving upon natural baselines.

Vector fields invariant under Lie group action are finitely generated by polynomial fields.

problem Understanding invariant vector fields under Lie group actions.
method Analyzing the module of smooth vector fields invariant under a linear action of a compact Lie group.
result The module of invariant vector fields is finitely generated by polynomial fields.

Properly discontinuous actions of a surface group by affine automorphisms of Rd\mathbb R^d were shown to exist by Danciger-Gueritaud-Kassel. We show, however, that if the linear part of an affine surface group action is in the Hitchin component, then the action fails to be properly discontinuous. The key case is that o…

2018-12-10abs ↗pdf ↗

New method for linear bandits with unknown sparsity, improving sparse regret bounds.

problem Sparse regret bounds for unknown sparsity and adversarial action sets.
method Combines online to confidence set conversions with randomized model selection over nested confidence sets.
result First sparse regret bounds for unknown sparsity and adversarial action sets.

This paper examines a proposal for gauging non-linear sigma models with respect to a Lie algebroid action. The general conditions for gauging a non-linear sigma model with a set of involutive vector fields are given. We show that it is always possible to find a set of vector fields which will (locally) admit a Lie alge…

2019-05-02abs ↗pdf ↗

We consider quotients of spheres by linear actions of real tori. To each quotient we associate a matroid built out of a diagonalization of the torus action. We find the integral homology groups of the resulting quotient spaces in terms of the Tutte polynomial of the matroid. We also find the homotopy type and homology …

2012-05-29abs ↗pdf ↗

This paper studies semiparametric contextual bandits, a generalization of the linear stochastic bandit problem where the reward for an action is modeled as a linear function of known action features confounded by an non-linear action-independent term. We design new algorithms that achieve O~(dT)\tilde{O}(d\sqrt{T}) regret …

2018-03-12abs ↗pdf ↗

We provide abelianizations of differentiable actions of finite groups on smooth real manifolds. De Concini-Procesi wonderful models for (local) subspace arrangements and a careful analysis of linear actions on real vector spaces are at the core of our construction. In fact, we show that our abelianizations have stabili…

2003-09-17abs ↗pdf ↗

Polynomial-time RL algorithm for constant actions under linear Bellman completeness.

problem Efficient online reinforcement learning with few actions.
method Polynomial-time algorithm based on linear function approximation.
result First computationally efficient algorithm for RL with constant actions under linear Bellman completeness.

Linear disentangled representations improve unsupervised action estimation.

problem Learning linear disentangled representations for unsupervised action estimation.
method Developed a method to induce irreducible representations in VAE models without labeled action sequences.
result Linear disentangled representations are a desirable property for unsupervised action estimation.

In this paper, we give a weak classification of locally linear pseudofree actions of the cyclic group of order 3 on a K3K3 surface, and prove the existence of such an action which can not be realized as a smooth action on the standard smooth K3K3 surface.

2006-04-13abs ↗pdf ↗

For linear actions of real reductive Lie groups we prove the Kempf-Ness Theorem about closed orbits and the Kirwan-Ness Stratification Theorem of the null cone. Since our completely self-contained proof focuses strongly on geometric and analytic methods, essentially avoiding any deep algebraic result, it applies also t…

2017-01-03abs ↗pdf ↗

In this survey, we discuss a series of linearization problems--for Poisson structures, Lie algebroids, and Lie groupoids. The last problem involves a conjecture on the structure of proper groupoids. Attempting to prove this by the method of averaging leads to problems concerning almost actions of compact groups and alm…

1999-12-22abs ↗pdf ↗

We define a fuchsian affine action of a surface group to be such that the linear part factors through a representation of SL(2,R)SL(2,{\mathbb R}). We prove a fuchsian affine action of a surface group is never proper.

2000-05-25abs ↗pdf ↗

Study uses Dynnikov coordinates to analyze actions of Dehn twists on a thrice-punctured disc.

problem Analyzing actions of Dehn twists in geometric group theory.
method Application of Dynnikov coordinates to describe orbits and dynamics of Dehn twists in a thrice-punctured disc.
result The action of Dehn twists has a geometric meaning as a piecewise linear Z2\mathbb{Z}^{2}-automorphism.

A federated learning algorithm tackles linear bandits with adversarial actions, achieving optimal regret bounds.

problem Federated linear bandits with finite adversarial action sets.
method FedSupLinUCB algorithm, extending SupLinUCB and OFUL principles.
result Achieves a total regret of ildeO(dT) ilde{O}(\sqrt{d T}), matching minimax lower bound and being order-optimal.

Limited annotated data available for the recognition of facial expression and action units embarrasses the training of deep networks, which can learn disentangled invariant features. However, a linear model with just several parameters normally is not demanding in terms of training data. In this paper, we propose an el…

2017-01-11abs ↗pdf ↗

TRAiL is a linear bandit algorithm that ensures optimal regret and guarantees inference quality.

problem Optimal regret and inference quality in linear bandits with convex action sets.
method TRAiL estimates the parameter through regularized least squares and perturbs the action set along the tangent plane.
result TRAiL achieves an Ω(T)Ω(\sqrt{T}) upper bound on cumulative regret with high probability.

New action poisoning attacks improve LinUCB's performance by changing action signals.

problem Improving understanding of adversarial attacks on contextual bandit algorithms.
method Proposed action poisoning attacks in white-box and black-box settings.
result Action poisoning attacks can force LinUCB to pull a target arm frequently with low cost.

Study finds unique radial solutions on manifolds using differential geometry and analysis.

problem Existence and uniqueness of solutions for semi-linear equations on manifolds.
method Combining differential geometry and analysis, transforming problems into equivalent ones over a submanifold of dimension one.
result Established the existence and uniqueness of constant solutions through orbits of a group action.

It is a consequence of the classical Jordan bound for finite subgroups of linear groups that in each dimension n there are only finitely many finite simple groups which admit a faithful, linear action on the n-sphere. In the present paper we prove an analogue for smooth actions on arbitrary homology n-spheres: in each …

2011-06-06abs ↗pdf ↗

The paper classifies symplectic forms on R^4 and determines invariants under symplectomorphisms.

problem Classifying symplectic forms on R^4 under symplectomorphisms.
method Using pfaffian and sum function invariants, the paper provides a complete description of orbit spaces and determines global invariants.
result The paper provides a complete classification of symplectic forms on R^4 under symplectomorphisms, providing necessary conditions for intertwining.

This is a review with examples concerning the concepts of affine (in particular, constant and linear) vector fields and fundamental vector fields on a manifold. The affine, linear and constant vector fields on a manifold are shown to be in a bijective correspondence with the fundamental vector fields on it of respectiv…

2006-02-01abs ↗pdf ↗

Paper solves stochastic contextual linear bandits using linear bandit algorithms.

problem Stochastic contextual linear bandits with unknown context distribution.
method Establishes a reduction framework to convert to linear bandit problems.
result Achieves nearly optimal regret bound of O(dTlogT)O(d\sqrt{T\log T}).

The standard actions of finite groups on spheres S^d are linear actions, i.e. by finite subgroups of the orthogonal group O(d+1). We prove that, in each dimension d>5, there is a finite group G which admits a faithful, topological action on a sphere S^d but is not isomorphic to a subgroup of O(d+1). The situation remai…

2016-02-15abs ↗pdf ↗

PopArt efficiently solves sparse linear bandits with tighter recovery guarantees.

problem Sparse linear bandits where rewards depend on a few covariates.
method PopArt: a simple, computationally efficient sparse linear estimation method.
result Improved regret bounds compared to state-of-the-art algorithms.

In the present paper we establish the necessary and sufficient conditions for two generalized Abel differential equations to be locally equivalent under the action of the pseudogroup of linear transformations of the form {xf(x), yg(x)y+h(x)}\{x\mapsto f(x),~ y\mapsto g(x)\cdot y + h(x)\}. These conditions are formulated in terms of diff…

2014-11-20abs ↗pdf ↗

In recent works, the authors considered various Lagrangians, which are invariant under a Lie group action, in the case where the independent variables are themselves invariant. Using a moving frame for the Lie group action, they showed how to obtain the invariantized Euler-Lagrange equations and the space of conservati…

2013-06-04abs ↗pdf ↗