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

3672107143 · Jun 202019922001200920172026
48 results for bilinear maximization

In this note we prove the following three algebraic facts which have applications in the theory of holonomy groups and homogeneous spaces: Any irreducibly acting connected subgroup $G \subset Gl(n,\rr)$ is closed. Moreover, if GG admits an invariant bilinear form of Lorentzian signature, GG is maximal, i.e. it is con…

2005-07-04abs ↗pdf ↗

A geometric framework for metrics of maximal acceleration which is applicable to large proper accelerations is discussed, including a theory of connections associated with the geometry of maximal acceleration. In such a framework it is shown that the uniform bound on the proper maximal acceleration implies an uniform b…

2019-06-28abs ↗pdf ↗

Non-bilinear observations make optimal control harder, showing non-convex costs and non-affine optimal controllers.

problem Optimal control from bilinear observations in linear systems is challenging.
method Analytical and numerical methods to study the non-convex cost-to-go and non-affine optimal controllers.
result The Separation Principle does not hold for bilinear observations, leading to non-convex costs and non-affine optimal controllers.

The paper defines Z-graded hom-Lie superalgebras and explores their properties.

problem Understanding the structure and properties of Z-graded hom-Lie superalgebras.
method Definition and exploration of Z-graded hom-Lie superalgebras, invariant bilinear forms, and simplicity conditions.
result Maximal and minimal Z-graded hom-Lie superalgebras for local hom-Lie superalgebras are identified, and conditions for simplicity are checked.

This paper presents a novel unifying framework of bilinear LSTMs that can represent and utilize the nonlinear interaction of the input features present in sequence datasets for achieving superior performance over a linear LSTM and yet not incur more parameters to be learned. To realize this, our unifying framework allo…

2019-10-23abs ↗pdf ↗

A Hermitian symplectic manifold is a complex manifold endowed with a symplectic form ωω, for which the bilinear form ω(I,)ω(I\cdot,\cdot) is positive definite. In this work we prove ddcdd^c-lemma for 1- and (1,1)-forms for compact Hermitian symplectic manifolds of dimension 3. This shows that Albanese map for such manifol…

2015-06-24abs ↗pdf ↗

New algorithm reduces regret in graphical bilinear bandits.

problem Optimizing decisions in a network of agents playing bilinear games.
method Optimism in the face of uncertainty principle applied to combinatorial NP-hard problem.
result Upper bound of ildeO(T) ilde{O}(\sqrt{T}) on αα-regret demonstrated.

Generalization of twistor spinors to Kähler manifolds which are called Kählerian twistor spinors are considered. We find the differential equation satisfied by the bilinear forms of Kählerian twistor spinors. We show that the bilinear form equation reduces to Kählerian conformal Killing-Yano equation under special cond…

2018-11-26abs ↗pdf ↗

New algorithm solves complex stopping problems with robust optimization.

problem Solving complex stochastic optimal stopping problems.
method Simulation-based robust optimization with exact reformulation as a zero-one bilinear program.
result Developed polynomial-time heuristics and algorithms for practical solution.

Algorithm identifies bilinear dynamical systems from noisy data.

problem Learning a realization of a partially observed bilinear dynamical system.
method Regression of outputs to highly correlated covariates for Markov-like parameters.
result High probability error bounds on identification algorithm under uniform stability assumption.

Bilinear MLPs offer a new way to interpret deep learning models without complex nonlinearities.

problem Lack of mechanistic understanding in how MLPs compute.
method Introduced bilinear MLPs without element-wise nonlinearities, analyzed their weights using tensor and eigendecomposition.
result Bilinear MLPs provide interpretable weight structures and enable adversarial attacks and overfitting analysis.

The global symmetry algebras of partially-massless (PM) higher-spin (HS) fields in (A)dSd+1_{d+1} are studied. The algebras involving PM generators up to depth 2(1)2\,(\ell-1) are defined as the maximal symmetries of free conformal scalar field with 22\,\ell order wave equation in dd dimensions. We review the constructi…

2015-08-28abs ↗pdf ↗

Identifies bilinear systems from a single trajectory with optimal sample complexity.

problem Learning bilinear systems from a single trajectory of states and inputs.
method Uses a mild marginal mean-square stability assumption and martingale small-ball condition.
result Sample complexity and statistical error rates are optimal.

Generalizes Riemann's results on flat coordinates for non-symmetric bilinear forms.

problem Finding flat coordinates for non-symmetric bilinear forms.
method Provides explicit necessary and sufficient conditions for a tensor field of type (0,2) to be flat.
result Explicit conditions for a tensor field to have constant entries in local coordinates.

The theory of harmonic symmetric bilinear forms on a Riemannian manifold is an analogue of the theory of harmonic exterior differential forms on this manifold. To show this, we must consider every symmetric bilinear form on a Riemannian manifold as a one-form with values in the cotangent bundle of this manifold. In thi…

2019-08-06abs ↗pdf ↗

In Bipartite Correlation Clustering (BCC) we are given a complete bipartite graph GG with `+' and `-' edges, and we seek a vertex clustering that maximizes the number of agreements: the number of all `+' edges within clusters plus all `-' edges cut across clusters. BCC is known to be NP-hard. We present a novel approx…

2016-03-09abs ↗pdf ↗

Paper reduces sample complexity for bilinear systems identification to nearly constant.

problem Identifying discrete-time bilinear systems under bounded disturbances.
method Uses trajectory-dependent regressors and polynomial mean-square state growth analysis.
result Proves sample complexity of O~(1/ε)\widetilde{\mathcal O}(1/ε) for estimation error εε.

This note provides a neat and enjoyable expansion and application of the magnificent Ordentlich-Cover theory of "universal portfolios." I generalize Cover's benchmark of the best constant-rebalanced portfolio (or 1-linear trading strategy) in hindsight by considering the best bilinear trading strategy determined in hin…

2019-07-23abs ↗pdf ↗

Constructs a bilinear form from a quasimorphism on symplectic manifold groups.

problem Understanding symplectic group properties through quasimorphisms and bilinear forms.
method Develops machinery to construct a real-valued bilinear form from a quasimorphism on the commutator subgroup of symplectic group.
result The constructed bilinear form b\mathfrak{b} controls extendability of quasimorphisms and triviality of characteristic classes.

We study a natural map from representations of a free group of rank g in GL(n,C), to holomorphic vector bundles of degree 0 over a compact Riemann surface X of genus g, associated with a Schottky uniformization of X. Maximally unstable flat bundles are shown to arise in this way. We give a necessary and sufficient cond…

2001-04-23abs ↗pdf ↗

We define a type of biquandle which is a generalization of symplectic quandles. We use the extra structure of these bilinear biquandles to define new knot and link invariants and give some examples.

2007-08-14abs ↗pdf ↗

A parsimonious model reduces over-parameterization in skewed matrix variate mixtures.

problem Over-parameterization in skewed matrix variate mixtures.
method Parsimonious family of 256 models using bilinear factor analyzers constrained over clusters, with AECM algorithm for estimation.
result Extensive simulations and real-world datasets (MNIST, Olivetti faces) demonstrate the method's effectiveness.

Study learns linear system dynamics from noisy bilinear data.

problem Learning linear dynamics from bilinear observations with process and measurement noise.
method Regression with Kronecker product design, data-dependent and independent error bounds.
result Upper bounds on statistical error rates and sample complexity for learning dynamics matrices.

This thesis is concerned with the theory of invariant bilinear differential pairings on parabolic geometries. It introduces the concept formally with the help of the jet bundle formalism and provides a detailed analysis. More precisely, after introducing the most important notations and definitions, we first of all giv…

2009-04-21abs ↗pdf ↗

Unified bounds for sketched bilinear forms in machine learning and statistics.

problem Uniform bounds on sketched bilinear forms for modern analyses.
method Generic chaining and new techniques for handling suprema over pairs of sets.
result Improved convergence bounds for sketched Federated Learning and bandit algorithms.

We construct a gerbe over a complex reductive Lie group G attached to an invariant bilinear form on a maximal diagonalizable subalgebra which is Weyl group invariant and satisfies a parity condition. By restriction to a maximal compact subgroup K, one then gets a gerbe over K. For a simply-connected group, the parity c…

2000-02-19abs ↗pdf ↗

Study dynamics of alternating minimization for bilinear regression under large system limits.

problem Understanding the time evolution of alternating minimization for bilinear regression.
method Replica method applied to a multi-temperature glassy system.
result Dynamics of alternating minimization can be described by a two-dimensional discrete stochastic process.

In this paper the notion of an M-th order invariant bilinear differential pairing is introduced and a formal definition is given. If the manifold has an AHS structure, then various first order pairings are constructed. This yields a classification of all first order invariant bilinear differential pairings on homogeneo…

2007-03-29abs ↗pdf ↗

Improved SEG method converges to Nash equilibrium in bilinear games.

problem Stochastic bilinear minimax optimization problem
method Stochastic ExtraGradient (SEG) method with constant step size, iteration averaging, and scheduled restarting.
result Provable convergence to Nash equilibrium under standard settings, optimal convergence rate in interpolation setting.

The massless supermultiplet of eleven-dimensional supergravity can be generated from the decomposition of certain representation of the exceptional Lie group F4 into those of its maximal compact subgroup Spin(9). In an earlier paper, a dynamical Kaluza-Klein origin of this observation is proposed with internal space th…

2009-09-25abs ↗pdf ↗

We are interested in approximation of a multivariate function f(x1,,xd)f(x_1,\dots,x_d) by linear combinations of products u1(x1)ud(xd)u^1(x_1)\cdots u^d(x_d) of univariate functions ui(xi)u^i(x_i), i=1,,di=1,\dots,d. In the case d=2d=2 it is a classical problem of bilinear approximation. In the case of approximation in the L2L_2 space the bili…

2014-09-04abs ↗pdf ↗

We provide a diagrammatic computation for the bilinear form, which is defined as the pairing between the (relative) cup products with every local coefficients and every integral homology 2-class of every links in the 3-sphere. As a corollary, we construct bilinear forms on the twisted Alexander modules of links.

2016-02-02abs ↗pdf ↗

End-to-end algorithm for controlling bilinear systems with probabilistic noise.

problem Controlling bilinear systems with noisy data.
method Proposes an end-to-end algorithm using statistical learning theory and robust controller design.
result Derived finite sample identification error bounds and structurally suitable for control.

We introduce invariants of Hurwitz equivalence classes with respect to arbitrary group GG. The invariants are constructed from any right GG-modules MM and any GG-invariant bilinear function on MM, and are of bilinear forms. For instance, when GG is the mapping class group of the closed surface, Mg\mathcal{M}_g, w…

2016-11-14abs ↗pdf ↗

Over the years data has become increasingly higher dimensional, which has prompted an increased need for dimension reduction techniques. This is perhaps especially true for clustering (unsupervised classification) as well as semi-supervised and supervised classification. Although dimension reduction in the area of clus…

2017-12-22abs ↗pdf ↗

Efficient algorithm converges to Nash equilibrium in bilinear problems with bandit feedback.

problem Learning dynamics in bilinear saddle-point problems with bandit feedback.
method Uncoupled learning algorithm combining experimental design and FTRL with a tailored regularizer.
result Last-iterate convergence rate of ildeO(T1/4) ilde{O}(T^{-1/4}) in high probability.