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 admits an invariant bilinear form of Lorentzian signature, is maximal, i.e. it is con…
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.
169,341 papers · 148 categories
Trend · papers per month
48 results for “Bilinear Maximization”
New algorithms solve linear bandits in high dimensions efficiently.
problem Maximizing bilinear functions over convex sets and ellipsoids.
method Two novel algorithms for solving the problem efficiently.
result First known method to implement optimistic algorithms for linear bandits in high dimensions.
Maximal acceleration metrics limit spacetime curvature.
problem Bounding spacetime curvature under maximal acceleration.
method Developed a geometric framework for maximal acceleration metrics and associated connections, proving curvature bounds.
result Uniform bounds on curvature components follow from uniform bounds on maximal acceleration.
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.
New algorithm maximizes agreements in bipartite graphs.
problem Maximizing agreements in bipartite graphs with constraints.
method Combination of approximation algorithm and bilinear maximization.
result Achieves -approximation for -BCC with clusters.
New algorithms solve convex-concave problems faster than previous methods.
problem Solving min-max problems without bilinear structure.
method Stochastic primal-dual algorithms with logarithmic dual updates.
result Faster convergence rates than for certain problems.
A new framework improves LSTM performance without adding more parameters.
problem Improving LSTM performance without increasing model complexity.
method A unifying framework of bilinear LSTMs that balances hidden state vector size and weight matrix approximation quality.
result Bilinear LSTMs achieve superior performance compared to linear LSTMs without additional parameters.
A Hermitian symplectic manifold is a complex manifold endowed with a symplectic form , for which the bilinear form is positive definite. In this work we prove -lemma for 1- and (1,1)-forms for compact Hermitian symplectic manifolds of dimension 3. This shows that Albanese map for such manifol…
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 on -regret demonstrated.
The study generalizes twistor spinors to Kähler manifolds and finds bilinear form equations.
problem Generalizing twistor spinors to Kähler manifolds.
method Finding differential equations and reducing them to conformal Killing-Yano equations.
result Bilinear forms of Kählerian twistor spinors reduce to Kählerian conformal Killing-Yano equations under certain conditions.
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.
The paper studies harmonic symmetric bilinear forms on Riemannian manifolds and proves properties of the Bourguignon Laplacian.
problem Analyzing harmonic symmetric bilinear forms on Riemannian manifolds.
method Developed the theory of harmonic symmetric bilinear forms and proved properties of the Bourguignon Laplacian.
result The kernel of the Bourguignon Laplacian is a finite-dimensional vector space of harmonic symmetric bilinear forms on a compact Riemannian manifold.
This note improves on universal portfolios by using bilinear strategies.
problem Improving on the best constant-rebalanced portfolio.
method Generalizing the best bilinear trading strategy using performance-weighted averaging.
result A universal bilinear portfolio that asymptotically dominates the original universal portfolio.
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.
The global symmetry algebras of partially-massless (PM) higher-spin (HS) fields in (A)dS are studied. The algebras involving PM generators up to depth are defined as the maximal symmetries of free conformal scalar field with order wave equation in dimensions. We review the constructi…
In this paper, we extend Su-Zhang's Cheeger-Mueller type theorem for symmetric bilinear torsions to manifolds with boundary in the case that the Riemannian metric and the non-degenerate symmetric bilinear form are of product structure near the boundary. Our result also extends Bruening-Ma's Cheeger-Mueller type theorem…
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.
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.
Bernhard Riemann 1861 revisited: existence of flat coordinates for an arbitrary bilinear formmath.DG
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.
Invariants from bilinear forms help classify Lefschetz fibrations.
problem Classifying Lefschetz fibrations over the 2-sphere.
method Construct invariants from right G-modules and bilinear functions.
result Found infinitely many Lefschetz fibrations homeomorphic but not mutually isomorphic.
Study Lie algebras with specific bilinear forms, finding exceptions.
problem Characterizing Lie algebras with symmetric, invariant, and nondegenerate bilinear forms.
method Analyzing structural properties and exceptions of Lie algebras.
result Rare exceptions to the properties of Lie algebras with these bilinear forms.
Generalized Bilinear Deep Convolutional Neural Networks for Multimodal Biometric Identificationcs.LG
Proposes a new CNN approach for multimodal biometric identification.
problem Improving biometric identification accuracy across multiple modalities.
method Uses a bank of modality-specific CNNs, fuses their outputs, and optimizes the system.
result Significantly outperforms unimodal systems and demonstrates reduction in parameters.
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 for estimation error .
Enhances knot invariants using bilinear forms on vector spaces.
problem Improving classical and virtual knot invariants.
method Uses bilinear forms on vector spaces indexed by pairs of elements of a finite quandle.
result New enhanced invariants of knots and links.
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…
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 controls extendability of quasimorphisms and triviality of characteristic classes.
Diagrammatic method calculates knot pairings in 3-sphere.
problem Computing knot pairings in 3-sphere.
method Diagrammatic computation of bilinear forms.
result Constructs bilinear forms on twisted Alexander modules.
Generalized B-Opersmath.AG
Introduces and studies generalized B-opers with bilinear forms.
problem Understanding higher rank opers with bilinear forms.
method Studies the structure of generalized B-opers using jet bundles and geometric structures on Riemann surfaces.
result Structure of generalized B-opers is studied and related to jet bundles and geometric structures.
On bilinear biquandlesmath.QA
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.
Gradient methods converge better for alternating updates in bilinear zero-sum games.
problem Understanding the dynamics of gradient algorithms for bilinear zero-sum games.
method Systematic analysis of popular gradient updates for simultaneous and alternating versions of bilinear zero-sum games.
result Alternating updates converge better than simultaneous ones, with optimal parameter setup and rates.
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.
Abstract: Generalizes Riemann's bilinear relations for surfaces of genus ≥ 2.
problem No new significant results, but highlights a known observation.
method Generalization of Riemann's bilinear relations.
result No significant new results obtained.
ABIPNN improves neural network performance by processing vectors in each neuron.
problem Traditional neural networks fail to model associations among adjacent scalars.
method ABIPNN uses arbitrary bilinear products to process vector-valued neurons.
result ABIPNN outperforms conventional neural networks in multispectral image denoising and singing voice separation.
We use the Jones-Wenzl idempotents to construct a basis of Temperley-Lieb algebra TL_n. This allows a short calculation for a Gram determinant of Lickorish's bilinear form on the Temperley-Lieb algebra.
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…
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…
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.
BiN normalizes financial time-series for better forecasting.
problem Non-stationarity and multimodality in financial time-series data.
method Bilinear Normalization (BiN) incorporated into TABL networks.
result BiN-TABL outperforms other normalization methods in financial forecasting.
Proposes a low-rank bilinear pooling model for link prediction in knowledge graphs.
problem Link prediction in incomplete knowledge graphs.
method Factorized bilinear pooling model with Tucker decomposition constraints.
result Efficient and parameter-efficient model with low-rank approximation.
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.
Novel hybrid bilinear model improves epilepsy diagnosis accuracy.
problem Improving accuracy in epilepsy diagnosis and treatment.
method Hybrid bilinear deep learning network using sEEG and audiovisual monitoring.
result Obtained F1-scores of 97.4% and 97.2% on two seizure datasets.
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…
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…
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.
Proposes a bilinear form to efficiently represent high-order temporal action information.
problem Efficiently capturing subtle and precise actions in long videos.
method Low-rank frontal tensors and bilinear form for extracting high-order information.
result Bilinear form outperforms state-of-the-art methods on temporal action segmentation.
We are interested in approximation of a multivariate function by linear combinations of products of univariate functions , . In the case it is a classical problem of bilinear approximation. In the case of approximation in the space the bili…