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

Trend · papers per month

3857711,1561,541 · Jun 202019922001200920172026
48 results for N-tuples learning

Unified framework for N-tuples learning improves weakly supervised tasks.

problem Reducing annotation burden in supervised learning.
method Empirical risk minimization framework integrating pointwise unlabeled data.
result Framework improves generalization across various N-tuples learning tasks.

We develop the concept of a double (more generally n-tuple) principal bundle departing from a compatibility condition for a principal action of a Lie group on a groupoid.

2018-07-30abs ↗pdf ↗

Let V be a finite dimensional complex vector space and V^* its dual and let X in P(V) be a smooth projective variety of dimension n and degree d at least two. For a generic n-tuple of hyperplanes H_1,...,H_n in P(V^*)^n, the intersection of X with H_1,...,H_n consists of d distinct points. We define the "discriminant o…

2013-12-30abs ↗pdf ↗

We show that for every n2n\ge 2 there exists a torsion-free one-ended word-hyperbolic group GG of rank nn admitting generating nn-tuples (a1,,an)(a_1,\ldots ,a_n) and (b1,,bn)(b_1,\ldots ,b_n) such that the (2n1)(2n-1)-tuples $$(a_1,\ldots ,a_n, \underbrace{1,\ldots ,1}_{n-1 \text{times}})\hbox{ and }(b_1,\ldots, b_n, \underbrace{…

2013-09-28abs ↗pdf ↗

Koschorke introduced a map from the space of closed nn-component links to the ordered configuration space of nn-tuples of points in R3\mathbb{R}^3, and conjectured that this map separates homotopy links. The purpose of this paper is to construct an analogous map for string links, and to prove (1) this map in fact sep…

2015-04-13abs ↗pdf ↗

We investigate nn-component systems of conservation laws that possess third-order Hamiltonian structures of differential-geometric type. The classification of such systems is reduced to the projective classification of linear congruences of lines in Pn+2\mathbb{P}^{n+2} satisfying additional geometric constraints. Algeb…

2017-03-17abs ↗pdf ↗

We give a new definition of the Jones polynomial. Let L be an oriented knot or link obtained as the plat closure of a braid beta in B_{2n}. We define a covering space tilde{C} of the space of unordered n-tuples of distinct points in the 2n-punctured disk. We then describe two n-manifolds tilde{S} and tilde{T} in tilde{…

2002-01-23abs ↗pdf ↗

Given a virtual link diagram DD, we define its unknotting index U(D)U(D) to be minimum among (m,n)(m, n) tuples, where mm stands for the number of crossings virtualized and nn stands for the number of classical crossing changes, to obtain a trivial link diagram. By using span of a diagram and linking number of a diagram …

2018-06-05abs ↗pdf ↗

Let {T1,,Tn}\{T_1, \ldots, T_n\} be a set of nn commuting bounded linear operators on a Hilbert space H\mathcal{H}. Then the nn-tuple (T1,,Tn)(T_1, \ldots, T_n) turns H\mathcal{H} into a module over C[z1,,zn]\mathbb{C}[z_1, \ldots, z_n] in the following sense: \[\mathbb{C}[z_1, \ldots, z_n] \times \mathcal{H} \raro \clh, \quad \quad …

2013-08-28abs ↗pdf ↗

We study tori which are cyclic covers of the standard torus, that is, the deck transformation group of the covering map is cyclic. These covering tori can be parametrized in a natural way and we show that being cyclic is equivalent to certain arithmetic condition on these parameters. There is a natural $\mathrm{SL}(2,\…

2015-06-09abs ↗pdf ↗

An FI-module VV over a commutative ring k\bf{k} encodes a sequence (Vn)n0(V_n)_{n \geq 0} of representations of the symmetric groups (Sn)n0(\mathfrak{S}_n)_{n \geq 0} over k\bf{k}. In this paper, we show that for a "finitely generated" FI-module VV over a field of characteristic pp, the cohomology groups $H^t(\mathfrak{S}…

2015-05-16abs ↗pdf ↗

We introduce the SU(N)SU(N) Casson-Lin invariants for links LL in S3S^3 with more than one component. Writing L=1nL = \ell_1 \cup \cdots \cup \ell_n, we require as input an nn-tuple (a1,,an)Zn(a_1,\ldots, a_n) \in {\mathbb Z}^n of labels, where aja_j is associated with j\ell_j. The SU(N)SU(N) Casson-Lin invariant, denoted $h_{N,a}(…

2015-06-11abs ↗pdf ↗

Scientists and engineers rely on accurate mathematical models to quantify the objects of their studies, which are often high-dimensional. Unfortunately, high-dimensional models are inherently difficult, i.e. when observations are sparse or expensive to determine. One way to address this problem is to approximate the or…

2018-02-07abs ↗pdf ↗

Let GG be a group given by the presentation [<a_1,...,a_k,b_1,... b_k\,| a_i=u_i(\bar b), b_i=v_i(\bar a) \hbox{for} 1\le i\le k>,] where k2k\ge 2 and where the uiF(b1,...,bk)u_i\in F(b_1,..., b_k) and wiF(a1,...,ak)w_i\in F(a_1,..., a_k) are random words. Generically such a group is a small cancellation group and it is clear that $(a_1,...,…

2010-11-26abs ↗pdf ↗

The classifying space BDiff(Sg,n)(S_{g,n}) of the orientation-preserving diffeomorphism group of the surface Sg,nS_{g,n} of genus g>1g>1 with nn ordered marked points has a universal bundle \[ S_g \to \text{UDiff}(S_{g,n})\xrightarrowπ\text{BDiff}(S_{g,n}). \] The fixed nn points provide nn sections sis_i of ππ. In this p…

2016-11-14abs ↗pdf ↗

The conjugacy class of a generic unimodular 2 by 2 complex matrix is determined by its trace, which may be an arbitrary complex number. In the nineteenth century, it was known that a generic pair (X,Y) of such pairs is determined up to conjugacy by the triple of traces (tr(X),tr(Y),tr(XY), which may be an arbitary elem…

2009-01-11abs ↗pdf ↗

For every abelian compact Lie group A, we prove that the homotopical A-equivariant complex bordism ring, introduced by tom Dieck (1970), is isomorphic to the A-equivariant Lazard ring, introduced by Cole-Greenlees-Kriz (2000). This settles a conjecture of Greenlees. We also show an analog for homotopical real bordism r…

2019-12-16abs ↗pdf ↗

A commuting nn-tuple (T1,,Tn)(T_1, \ldots, T_n) of bounded linear operators on a Hilbert space $\clh$ associate a Hilbert module H\mathcal{H} over C[z1,,zn]\mathbb{C}[z_1, \ldots, z_n] in the following sense: \[\mathbb{C}[z_1, \ldots, z_n] \times \mathcal{H} \rightarrow \mathcal{H}, \quad \quad (p, h) \mapsto p(T_1, \ldots, T_n)h…

2014-09-27abs ↗pdf ↗

New solutions to SU(n+1) Toda system found on compact Riemann surfaces with cone singularities.

problem Solving SU(n+1) Toda system with cone singularities on compact Riemann surfaces.
method Character n-ensembles and toric curves on compact Riemann surfaces.
result Established a correspondence between character n-ensembles and toric solutions to SU(n+1) system with cone singularities.

In this paper, we develop a method for unsupervised clustering of two-way (matrix) data by combining two recent innovations from different fields: the Sparse Subspace Clustering (SSC) algorithm [10], which groups points coming from a union of subspaces into their respective subspaces, and the t-product [18], which was …

2014-12-22abs ↗pdf ↗

We extend Obata's rigidity theorem to free probability.

problem Establishing a free analogue of Obata's rigidity theorem.
method Analyzing self-adjoint nn-tuples with Lipschitz conjugate variables under a non-commutative curvature-dimension condition.
result The von Neumann algebra splits off a freely complemented semicircular component, revealing a rigidity mechanism under non-commutative curvature.

Let F be a field of characteristic different from 2, and let FnF^{n} denote the vector space of n-tuples of elements in F. Let e1,...,en{e_{1}, ... , e_{n}} denote the canonical basis of FnF^{n}. Let r and s be nonnegative integers such that r + s = n, and let Q denote the nondegenerate bilinear form on FnF^{n} such that $Q(e…

2017-01-25abs ↗pdf ↗

In this paper we give a close-to-sharp answer to the basic questions: When is there a continuous way to add a point to a configuration of nn ordered points on a surface SS of finite type so that all the points are still distinct? When this is possible, what are all the ways to do it? More precisely, let PConfn(S)_n(S)

2017-08-26abs ↗pdf ↗

Meta-learning improves neural networks by adapting learning algorithms.

problem Conventional AI approaches solve tasks from scratch, but meta-learning aims to improve the learning algorithm.
method Meta-learning adapts a learning algorithm based on multiple learning episodes.
result Meta-learning can tackle deep learning challenges like data and computation bottlenecks.

Study Whittle index learning algorithms for restless bandits with constant stepsizes.

problem Optimizing decisions in restless multi-armed bandits with constant stepsizes.
method Developed Q-learning algorithms with constant stepsizes for index learning in restless bandits, extending to DQN and function approximations.
result The algorithms learn the Whittle index effectively.

New unsupervised learning technique learns independent kernels for better machine learning tasks.

problem Improving unsupervised representation learning for machine learning tasks.
method Stacking convolutional transforms using alternating proximal minimization scheme.
result DCTL outperforms shallow version CTL on benchmark datasets.

New self-imitation learning method improves performance in continuous control tasks.

problem Improving off-policy learning in continuous control tasks.
method Proposes a n-step lower bound to generalize lower-bound Q-learning and introduces a new family of self-imitation learning algorithms.
result n-step lower bound Q-learning achieves a better trade-off between bias and contraction rate, leading to improved performance.

Deep reinforcement learning finds optimal learning policies for adaptive systems.

problem Finding individualized learning plans for learners with unknown latent traits.
method Formulated as a Markov decision process, applied deep Q-learning with a transition model estimator.
result The algorithm efficiently discovers optimal learning policies with small data sets.

Study batch reinforcement learning methods for personalized medical treatments.

problem Batch reinforcement learning for personalized medical treatments.
method Direct policy learning and model-based learning approaches.
result Model-based learning is impossible with finite model classes but feasible with relaxed conditions.

A new meta-meta classification method tackles few-shot learning tasks.

problem Learning with limited data in small-data settings.
method Designing an ensemble of learners for a large set of problems, then learning how to combine them for a new problem.
result Meta-meta classification outperforms traditional meta-learning and ensembling approaches in one-shot learning tasks.