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.
Proof of convergence for multi-objective optimization using inverse reinforcement learning.
A new method prioritizes project risks using Monte Carlo Simulation.
In this paper, we investigate the possibility of improving the performance of multi-objective optimization solution approaches using machine learning techniques. Specifically, we focus on multi-objective binary linear programs and employ one of the most effective and recently developed criterion space search algorithms…
The use of orthogonal projections on high-dimensional input and target data in learning frameworks is studied. First, we investigate the relations between two standard objectives in dimension reduction, preservation of variance and of pairwise relative distances. Investigations of their asymptotic correlation as well a…
The approximation of nonlinear kernels via linear feature maps has recently gained interest due to their applications in reducing the training and testing time of kernel-based learning algorithms. Current random projection methods avoid the curse of dimensionality by embedding the nonlinear feature space into a low dim…
Obtaining complete information about the shape of an object by looking at it from a single direction is impossible in general. In this paper, we theoretically study obtaining differential geometric information of an object from orthogonal projections in a number of directions. We discuss relations between (1) a space c…
We examine the relationships between the differential invariants of objects and of their images under a surjective map. We analyze both the case when the underlying transformation group is projectable and hence induces an action on the image, and the case when only a proper subgroup of the entire group acts projectably…
Paper studies pseudo-projective tensors on warped products.
In this work, we consider an extension of graphical models to random graphs, trees, and other objects. To do this, many fundamental concepts for multivariate random variables (e.g., marginal variables, Gibbs distribution, Markov properties) must be extended to other mathematical objects; it turns out that this extensio…
Paper proposes redundancy-free features for zero-shot object recognition.
The paper is grown from the lecture course "Metric projective geometry" which I hold at the summer school "Finsler geometry with applications" at Karlovassi, Samos, in 2014, and at the workshop before the 8th seminar on Geometry and Topology of the Iranian Mathematical society at the Amirkabir University of Technology …
EIM algorithm maximizes information projection for multi-modal data modeling.
A new projection method for convex optimization reduces computation costs.
Paper examines convergence rate of PGD for BP objective in inverse problems.
Develop a framework for barycentric projections of optimal transport plans on Riemannian manifolds.
ETQFTs created from non-semisimple modular categories.
Consider a finite dimensional (generally reducible) polynomial representation ρof GL_n. A projective compactification of GL_n is the closure of ρ(GL_n) in the space of all operators defined up to a factor (this class of spaces can be characterized as equivariant projective normal compactifications of GL_n). We give an …
Motivated by applications in computational anatomy, we consider a second-order problem in the calculus of variations on object manifolds that are acted upon by Lie groups of smooth invertible transformations. This problem leads to solution curves known as Riemannian cubics on object manifolds that are endowed with norm…
The lack of proper class discrimination among the Hyperspectral (HS) data points poses a potential challenge in HS classification. To address this issue, this paper proposes an optimal geometry-aware transformation for enhancing the classification accuracy. The underlying idea of this method is to obtain a linear proje…
Defines super projective modules and explores their properties.
This work demonstrates a physical attack on a deep learning image classification system using projected light onto a physical scene. Prior work is dominated by techniques for creating adversarial examples which directly manipulate the digital input of the classifier. Such an attack is limited to scenarios where the adv…
SPACE models complex scenes by decomposing objects and backgrounds.
We present a novel algorithm for deciding whether a given planar curve is an image of a given spatial curve, obtained by a central or a parallel projection with unknown parameters. The motivation comes from the problem of establishing a correspondence between an object and an image, taken by a camera with unknown posit…
Classifies and constructs intertwining differential operators between vector bundles over real projective space.
New pushforward operation on vector pseudo-bundles creates new examples.
Scientific imaging techniques such as optical and electron microscopy and computed tomography (CT) scanning are used to study the 3D structure of an object through 2D observations. These observations are related to the original 3D object through orthogonal integral projections. For common 3D reconstruction algorithms, …
New research suggests continual learning should focus on both optimization objective and optimization trajectory.
We study the projected gradient descent method on low-rank matrix problems with a strongly convex objective. We use the Burer-Monteiro factorization approach to implicitly enforce low-rankness; such factorization introduces non-convexity in the objective. We focus on constraint sets that include both positive semi-defi…
Canonical Correlation Analysis (CCA) is widely used for multimodal data analysis and, more recently, for discriminative tasks such as multi-view learning; however, it makes no use of class labels. Recent CCA methods have started to address this weakness but are limited in that they do not simultaneously optimize the CC…
This paper generalizes monodromy maps for projective structures with poles.
Optimizes reinsurance and investment strategies to minimize ruin probability.
Frank-Wolfe algorithm (FW) and its variants have gained a surge of interests in machine learning community due to its projection-free property. Recently people have reduced the gradient evaluation complexity of FW algorithm to for the smooth and strongly convex objective. This complexity result is esp…
Geometric theory of projection heads in self-supervised learning.
Motivated by vision tasks such as robust face and object recognition, we consider the following general problem: given a collection of low-dimensional linear subspaces in a high-dimensional ambient (image) space, and a query point (image), efficiently determine the nearest subspace to the query in distance. In…
Torsion objects of von Neumann categories describe the phenomen "spectrum near zero" discovered by S. Novikov and M. Shubin. In this paper we classify Hermitian forms on torsion objects of a finite von Neumann category. We prove that any such form can be represented as a discriminant form of a degenerate Hermitian form…
TROLL improves RL for LLMs by replacing clipping with a trust region projection.
We study curvature-adapted submanifolds of general symmetric spaces. We generalize Cartan's theorem for isoparametric hypersurfaces of spheres and Wang's classification of isoparametric Hopf hypersurfaces in complex projective spaces to any compact symmetric space. Our second objective is to investigate such hypersurfa…
Top 8 robotic vision systems tackled lifelong object recognition challenges.
Variable projection solves structured optimization problems by completely minimizing over a subset of the variables while iterating over the remaining variables. Over the last 30 years, the technique has been widely used, with empirical and theoretical results demonstrating both greater efficacy and greater stability c…
We present an objective function for learning with unlabeled data that utilizes auxiliary expectation constraints. We optimize this objective function using a procedure that alternates between information and moment projections. Our method provides an alternate interpretation of the posterior regularization framework (…
Decentralized optimization algorithms have received much attention due to the recent advances in network information processing. However, conventional decentralized algorithms based on projected gradient descent are incapable of handling high dimensional constrained problems, as the projection step becomes computationa…
Deployment of emerging technologies and rapid change in industries has created a lot of risk for initiating the new projects. Many techniques and suggestions have been introduced but still lack the gap from various prospective. This paper proposes a reliable project scheduling approach. The objectives of project schedu…
We give a simple proof that the Frank-Wolfe algorithm obtains a stationary point at a rate of on non-convex objectives with a Lipschitz continuous gradient. Our analysis is affine invariant and is the first, to the best of our knowledge, giving a similar rate to what was already proven for projected gra…
We propose an unsupervised object matching method for relational data, which finds matchings between objects in different relational datasets without correspondence information. For example, the proposed method matches documents in different languages in multi-lingual document-word networks without dictionaries nor ali…
A dissertation on scalable projection-free optimization methods.
We define an algebraic/combinatorial object on the front projection of a Legendrian knot called a Morse complex sequence, abbreviated MCS. This object is motivated by the theory of generating families and provides new connections between generating families, normal rulings, and augmentations of the Chekanov-Eliashb…
Efficiently solves heterogeneous QPs by reducing variables using instance-specific projections.
New findings on geometric flows and equidistribution in Hilbert geometry.