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

Trend · papers per month

94188281375 · Jun 202019922001200920172026
48 results for Weight vectors

Defines linear weightings for vector bundles and explores their applications.

problem Understanding and extending the concept of weightings in vector bundles.
method Constructs weighted normal bundles and deformation spaces; explains the relationship between weightings and differential operators.
result Captures the rescaled spinor bundle and related constructions.

Novel metric space magnitude and weighting vectors improve machine learning tasks.

problem Improving machine learning algorithms using novel metric space concepts.
method Metric space magnitude and weighting vectors for better machine learning.
result The weighting vector effectively detects boundaries and improves classic machine learning tasks.

The note answers a question about Betti numbers for 1D Euclidean space.

problem Understanding Betti numbers for vector fields and differential forms in 1D Euclidean space.
method Using Euler vector field and Lie superalgebra structure.
result The Betti numbers are 1 for the case where primary and secondary weights are equal.

This paper optimizes binary linear classifiers by tuning their weight vectors.

problem Optimizing the weight vector of binary linear classifiers for better performance.
method Parameterization of the discriminant through a scalar to control trade-offs between informative and noisy terms.
result Weight vector tuning compensates for non-optimal native hyperparameters, improving classification performance.

This paper proposes a new evaluation metric and boosting method for weight separability in neural network design. In contrast to general visual recognition methods designed to encourage both intra-class compactness and inter-class separability of latent features, we focus on estimating linear independence of column vec…

2019-10-20abs ↗pdf ↗

New method uses weighting vectors for efficient boundary and outlier detection.

problem Boundary and outlier detection in machine learning.
method Recast metric space magnitude as weighting vector, solve kernelized SVM, apply nearest neighbor methods.
result Weighting vector can be efficiently approximated in linear time, outperforming state-of-the-art techniques.

Three new efficient algorithms project vectors onto weighted l1 ball.

problem Sparse system identification and feature selection.
method Projected gradient descent algorithms with linear or highly competitive quadratic worst case complexities.
result Efficient tools for machine learning methods like compress sensing and feature selection.

In this paper, we define locally convex vector spaces of weighted vector fields and use them as model spaces for Lie groups of weighted diffeomorphisms on Riemannian manifolds. We prove an easy condition on the weights that ensures that these groups contain the compactly supported diffeomorphisms. We finally show that …

2016-01-12abs ↗pdf ↗

The study of quotient structures in multi-graded bundles, including double vector bundles.

problem Understanding quotients of multi-graded bundles, especially double vector bundles.
method Analyzing quotients as towers of affine bundles and constructing normal bundles.
result Any quotient of multi-graded bundles fits into a tower of affine bundles.

The study counts periodic orbits on smooth manifolds, adding ghost orbits for completeness.

problem Counting periodic orbits of vector fields on smooth closed manifolds.
method Enlarging the space of orbits to include ghost orbits, defining weight functions, and showing constancy under deformation.
result The weight function remains constant as the vector field moves and ΓΓ deforms.

Develops theory of weightings for Lie groupoids and algebroids.

problem Understanding differential geometry of weightings for Lie groupoids and algebroids.
method Extending work on weighted manifolds, defining weighted submanifolds, and developing theories of linear weightings and multiplicative weightings.
result Characterizes infinitesimally multiplicative weightings for Lie algebroids and classifies multiplicative weightings of Lie groupoids.

In this paper we study the problem of learning Rectified Linear Units (ReLUs) which are functions of the form max(0,<w,x>)max(0,<w,x>) with ww denoting the weight vector. We study this problem in the high-dimensional regime where the number of observations are fewer than the dimension of the weight vector. We assume that the we…

2017-05-10abs ↗pdf ↗

The study examines stable regions in weighted manifolds with boundary properties.

problem Studying stable regions in weighted manifolds with boundary properties.
method Using deformations constructed from parallel vector fields tangent to the boundary, the study deduces rigidity properties for stable sets.
result The classification of stable sets in some Riemannian cylinders and uniqueness results for minimizers.

We show that from an even degree symplectic NQ-manifold, whose homological vector field Q preserves the symplectic form, one can construct a weight system for tri-valent graphs with values in the Q-cohomology ring, satisfying the IHX relation. Likewise, given a representation of the homological vector field, one can co…

2011-10-24abs ↗pdf ↗

We give a general description of the construction of weighted spherically symmetric metrics on vector bundle manifolds, i.e. the total space of a vector bundle EME\rightarrow M, over a Riemannian manifold MM, when EE is endowed with a metric connection. The tangent bundle of EE admits a canonical decomposition and t…

2014-11-21abs ↗pdf ↗

Constructing transitive nilpotent Lie algebras from dilations and analyzing their prolongations.

problem Understanding the derivations of Tanaka prolongations of transitive nilpotent Lie algebras.
method Constructing transitive nilpotent Lie algebras from dilations and analyzing their prolongations.
result Derivations of degree 0 are given by vector fields of degree 0, and the Tanaka prolongation recovers the whole algebra of polynomial vectors defined by the dilation.

We propose ββ-graph embedding for robustly learning feature vectors from data vectors and noisy link weights. A newly introduced empirical moment ββ-score reduces the influence of contamination and robustly measures the difference between the underlying correct expected weights of links and the specified generative m…

2019-02-22abs ↗pdf ↗

A weight system on graph homology was constructed by Rozansky and Witten using a compact hyperkähler manifold. A variation of this construction utilizing holomorphic vector bundles over the manifold gives a weight system on chord diagrams. We investigate these weights from the hyperkähler geometry point of view.

2000-02-25abs ↗pdf ↗

Graded bundles are a particularly nice class of graded manifolds and represent a natural generalisation of vector bundles. By exploiting the formalism of supermanifolds to describe Lie algebroids we define the notion of a weighted AA-connection on a graded bundle. In a natural sense weighted AA-connections are adapte…

2018-10-10abs ↗pdf ↗

In this paper, we give a new generalization of positive sectional curvature called positive weighted sectional curvature. It depends on a choice of Riemannian metric and a smooth vector field. We give several simple examples of Riemannian metrics which do not have positive sectional curvature but support a vector field…

2014-10-06abs ↗pdf ↗

In representation learning (RL), how to make the learned representations easy to interpret and less overfitted to training data are two important but challenging issues. To address these problems, we study a new type of regulariza- tion approach that encourages the supports of weight vectors in RL models to have small …

2017-11-25abs ↗pdf ↗

New method preserves privacy by aggregating feature-vectors with weighted sums, ensuring label differential privacy.

problem Ensuring privacy in training data aggregation for sensitive labels.
method Learning from bag aggregates (LBA) with weighted Gaussian sums, preserving label differential privacy (label-DP).
result Weighted LBA using iid Gaussian weights with mm randomly sampled disjoint kk-sized bags provides (ε,δ)(\varepsilon, δ)-label-DP.

Most of the information is stored as text, so text mining is regarded as having high commercial potential. Aiming at the semantic constraint problem of classification methods based on sparse representation, we propose a weighted recurrent neural network (W-RNN), which can fully extract text serialization semantic infor…

2019-09-28abs ↗pdf ↗

Post-training quantization method using multiple low-precision points achieves higher precision for critical weights.

problem Discretizing pre-trained deep neural networks without re-training.
method Multipoint quantization with efficient greedy selection and adaptive point number.
result Outperforms state-of-the-art methods on ImageNet classification and PASCAL VOC object detection.

Paper establishes identifiability conditions for a model with two latent vectors and auxiliary data.

problem Identifying conditions for a statistical model with two latent vectors and auxiliary data.
method Proposes a statistical model with two latent vectors and auxiliary data, establishing various identifiability conditions.
result Identifiability conditions reveal a dimensionality relation and link model indeterminacies to maximum link weights.

Forecast dam inflow using sea surface feature weights.

problem Accurate dam inflow forecasting for flood mitigation.
method Extracted sea surface features, applied L2-norm ensemble weighting, used PCA and t-SNE for dimensionality reduction, and calibrated regression models.
result The proposed method improves predictor stability and accuracy in dam inflow forecasting.

OTSS learns personalized decision weights from logged decisions and outputs.

problem Learning context-specific decision weights from logged decisions and outputs.
method Output-targeted soft-segmentation model that deploys personalized decision-ready weight vectors.
result OTSS achieves the lowest mean regret in benchmark settings.

This study reveals the critical role of scale vectors in large language models, improving optimization and expressivity.

problem Understanding and optimizing the scale vectors in large language models.
method Systematic study of scale vectors from expressivity, optimization, and architectural perspectives; theoretical and empirical analysis of weight decay; proposing and evaluating improvements.
result Scale vectors improve optimization through a self-amplifying preconditioning effect and are beneficial for expressivity in certain architectures.

Paper refines Alesker-Bernig-Schuster theorem, proving Hodge-Riemann relations for Euclidean balls.

problem Understanding translation-invariant valuations and their geometric implications.
method Explicit construction of highest weight vectors and analysis of natural operations on these vectors.
result Proof of Hodge-Riemann relations for Euclidean balls, extending geometric inequalities.

Gradient flow on softmax attention minimizes nuclear norm of weight matrices.

problem Classification with separate key and query weight matrices.
method Gradient flow on exponential loss, separability assumption, reparameterization, approximate KKT conditions.
result Gradient flow implicitly minimizes nuclear norm of weight matrices, contrasting with Frobenius norm minimization.

The paper proposes a method to improve forecast combination accuracy using portfolio theory.

problem Improving forecast accuracy by combining multiple forecasts.
method Generates forecast combinations using a portfolio analogy, allowing negative weights for hedging.
result Demonstrates improved performance in weighted random forest forecasts.

We introduce and study the Wilson loops in a general 3D topological field theories (TFTs), and show that the expectation value of Wilson loops also gives knot invariants as in Chern-Simons theory. We study the TFTs within the Batalin-Vilkovisky (BV) and Alexandrov-Kontsevich-Schwarz-Zaboronsky (AKSZ) framework, and the…

2010-06-07abs ↗pdf ↗

Stochastic gradient descent (SGD) is commonly used for optimization in large-scale machine learning problems. Langford et al. (2009) introduce a sparse online learning method to induce sparsity via truncated gradient. With high-dimensional sparse data, however, the method suffers from slow convergence and high variance…

2016-04-21abs ↗pdf ↗