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

591418 · May 202619922001200920172026
48 results for data-dependent unitaries

Quantum neural networks need both data-dependent and trainable unitaries for effective geometric deformation.

problem Quantum neural networks lack the geometric flexibility of classical networks due to limitations in state reachability.
method Viewing quantum states as embedded manifolds, we analyze infinitesimal unitary actions and introduce the CLA maps and aCLS criterion.
result Geometric flexibility in quantum neural networks requires a joint dependence on data and trainable weights.

We formulate the unitary rational orbifold conformal field theories in the algebraic quantum field theory framework. Under general conditions, we show that the orbifold of a given unitary rational conformal field theories generates a unitary modular category. Many new unitary modular categories are obtained. We also sh…

2000-04-24abs ↗pdf ↗

We reformulate data-dependent constraints to ensure they are always met with high probability.

problem Ensuring fairness and stability in machine learning models with data-dependent constraints.
method Calibrated reformulation of constraints to guarantee satisfaction with a specified probability.
result Our method guarantees that fairness constraints are met at test time with high probability.

Recurrent neural networks are powerful models for processing sequential data, but they are generally plagued by vanishing and exploding gradient problems. Unitary recurrent neural networks (uRNNs), which use unitary recurrence matrices, have recently been proposed as a means to avoid these issues. However, in previous …

2016-10-31abs ↗pdf ↗

Study on determinants of unitary Brownian motion and their asymptotic laws.

problem Understanding determinants of unitary Brownian motion and their behavior over time.
method Using Stiefel fibration and skew-product decomposition of the Stiefel Brownian motion.
result Prove asymptotic laws for determinants of block entries of unitary Brownian motion.

We construct a new family of toric manifolds generating the unitary bordism ring. Each manifold in the family is the complex projectivisation of the sum of a line bundle and a trivial bundle over a complex projective space. We also construct a family of special unitary quasitoric manifolds which contains polynomial gen…

2014-12-16abs ↗pdf ↗

We present a study of generalization for data-dependent hypothesis sets. We give a general learning guarantee for data-dependent hypothesis sets based on a notion of transductive Rademacher complexity. Our main result is a generalization bound for data-dependent hypothesis sets expressed in terms of a notion of hypothe…

2019-04-09abs ↗pdf ↗

Study circle actions on unitary manifolds with discrete fixed points.

problem Understanding circle actions on compact unitary manifolds with discrete fixed points.
method Prove relationships between weights at fixed points and derive results regarding the first equivariant Chern class and Hirzebruch χyχ_y-genus.
result Derive a multigraph encoding fixed point data, leading to new insights into unitary S1S^1-manifolds.

A major challenge in the training of recurrent neural networks is the so-called vanishing or exploding gradient problem. The use of a norm-preserving transition operator can address this issue, but parametrization is challenging. In this work we focus on unitary operators and describe a parametrization using the Lie al…

2016-07-17abs ↗pdf ↗

PAC-Bayesian theory applied to data-dependent hypothesis sets yields uniform generalization bounds.

problem Proving uniform generalization bounds for data-dependent hypothesis sets.
method Applying PAC-Bayesian framework on 'random sets' and considering data-dependent hypothesis sets.
result Data-dependent uniform generalization bounds are proven, providing tighter and unified results.

The study shows ergodicity of unitary frame flows on Kähler manifolds with specific curvature conditions.

problem Ergodicity of unitary frame flows on Kähler manifolds with negative holomorphic sectional curvature.
method Analysis of the unitary frame flow on the principal U(m)-bundle of unitary frames.
result For even-dimensional Kähler manifolds with negative λ(m)-pinched holomorphic sectional curvature, the unitary frame flow is ergodic and mixing.

With the usual definition of a super Hilbert space and a super unitary representation, it is easy to show that there are lots of super Lie groups for which the left-regular representation is not super unitary. I will argue that weakening the definition of a super Hilbert space (by allowing the super scalar product to b…

2017-11-01abs ↗pdf ↗

This paper introduces a submanifold of the moduli space of unitary representations of the fundamental group of a punctured sphere with fixed local monodromy. The submanifold is defined via products of involutions through Lagrangian subspaces. We show that the moduli space of Lagrangian representations is a Lagrangian s…

2005-06-06abs ↗pdf ↗

Paper introduces data-dependent SSP for private linear and logistic regression.

problem Private linear and logistic regression with better performance.
method Data-dependent sufficient statistic perturbation (SSP) for linear and logistic regression.
result Data-dependent SSP outperforms state-of-the-art methods for linear and logistic regression.

Researchers describe unitary representations of mixed braid groups.

problem Understanding unitary representations of mixed braid groups.
method Explicitly describe unitary representations on cohomology of Abelian branched covers.
result Image of the representation is generated by complex reflections and related to the multivariate Burau representation.

Let Uc(H)=u:uisunitaryandu1iscompactU_c(H)={u: u is unitary and u-1 is compact} stand for the unitary Fredholm group. We prove the following convexity result. Denote by dd_\infty the rectifiable distance induced by the Finsler metric given by the operator norm in Uc(H)U_c(H). If u0,u1,uUc(H)u_0,u_1,u\in U_c(H) and the geodesic ββ joining u0u_0 and u1u_1 in $U…

2008-12-24abs ↗pdf ↗

The paper shows robustness and generalization are closely connected via data-dependent bounds.

problem Connecting robustness and generalization in machine learning.
method Data-dependent generalization bounds that reduce dependence on covering number and hypothesis space.
result Proves robustness implies generalization, with near-exponential improvements in various situations.

Researchers extend geometric quantization to complex Abelian Lie supergroups.

problem Quantization of super Kähler structures on complex Abelian Lie supergroups.
method Extended geometric quantization scheme to super Kähler setting, constructed unitary representation.
result Irreducible subrepresentations of the constructed representation are determined by the moment map.

Curious structure of special orthogonal, unitary, and symplectic groups as products of Grassmannians discovered.

problem Understanding the structure of special orthogonal, unitary, and symplectic groups.
method Expressing these groups as products of Grassmannians realized as involution matrices.
result Special orthogonal, special unitary, and symplectic groups can be expressed as products of their corresponding Grassmannians.

Study on learning quantum dynamics without direct interaction.

problem Learning quantum dynamics incoherently without direct interaction.
method Analyze sample complexity and prove bounds for incoherent learning.
result Prove that arbitrary measurements allow efficient learning of unitary processes incoherently.

We give in explicit form the principal kinematic formula for the action of the affine unitary group on $\C^n$, together with a straightforward algebraic method for computing the full array of unitary kinematic formulas, expressed in terms of certain convex valuations introduced, essentially, by H. Tasaki. We introduce …

2008-01-04abs ↗pdf ↗

The study improves representation learning bounds using data-dependent Gaussian mixtures.

problem Improving generalization in representation learning.
method Established bounds using relative entropy and MDL of latent variables.
result The approach significantly improves generalization over existing methods.

Meta-learning bounds derived using PAC-Bayes theory for improved generalization.

problem Uncertainty in generalization performance for meta-learning with new tasks.
method PAC-Bayes relative entropy bounds and empirical risk minimization (ERM) method.
result Competitive generalization performance and rapid convergence with data-dependent prior.

The Probably Approximately Correct (PAC) Bayes framework (McAllester, 1999) can incorporate knowledge about the learning algorithm and (data) distribution through the use of distribution-dependent priors, yielding tighter generalization bounds on data-dependent posteriors. Using this flexibility, however, is difficult,…

2018-02-26abs ↗pdf ↗

The existence of kinematic formulas for area measures with respect to any connected, closed subgroup of the orthogonal group acting transitively on the unit sphere is established. In particular, the kinematic operator for area measures is shown to have the structure of a co-product. In the case of the unitary group the…

2013-08-28abs ↗pdf ↗

Recurrent neural networks (RNNs) have been successfully used on a wide range of sequential data problems. A well known difficulty in using RNNs is the \textit{vanishing or exploding gradient} problem. Recently, there have been several different RNN architectures that try to mitigate this issue by maintaining an orthogo…

2018-11-09abs ↗pdf ↗

New algorithm achieves data-dependent regret bounds in MDPs with unknown transitions.

problem Achieving best-of-both-worlds guarantees with data-dependent regret bounds in MDPs with unknown transitions.
method Optimistic follow-the-regularized-leader algorithm with new optimistic Q-function estimators and transition bonus.
result First-order, second-order, and path-length bounds with polylog(T) regret in the stochastic regime.

Topological quantum computation with Fibonacci anyons relies on the possibility of efficiently generating unitary transformations upon pseudoparticles braiding. The crucial fact that such set of braids has a dense image in the unitary operations space is well known; in addition, the Solovay-Kitaev algorithm allows to a…

2008-01-18abs ↗pdf ↗

We propose a method to assign non-unitary TQFTs to certain SCFTs, deriving bounds and examples.

problem Assigning non-unitary TQFTs to specific SCFTs of rank 0.
method Using degenerate limits of SCFTs, extracting modular data from supersymmetric partition functions, and proposing a dictionary.
result Deriving a lower bound on the free energy of SCFTs and showing it is saturated by a specific SCFT.

Bismut and Zhang computed the ratio of the Ray-Singer and the combinatorial torsions corresponding to non-unitary representations of the fundamental group. In this note we show that for representations which belong to a connected component containing a unitary representation the Bismut-Zhang formula follows rather easi…

2013-04-19abs ↗pdf ↗

We present a novel recurrent neural network (RNN) based model that combines the remembering ability of unitary RNNs with the ability of gated RNNs to effectively forget redundant/irrelevant information in its memory. We achieve this by extending unitary RNNs with a gating mechanism. Our model is able to outperform LSTM…

2017-06-08abs ↗pdf ↗