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

Trend · papers per month

265278104 · May 202619922001200920172026
48 results for secant alignment

A new method improves density ratio estimation with fewer function evaluations.

problem Stable and accurate estimation of density ratios with high variance issues.
method Diffusion Secant Alignment for Score-Based Density Ratio Estimation (ISA-DRE)
result ISA-DRE achieves comparable or superior results with fewer function evaluations.

The secant caustic of a planar curve MM is the image of the singular set of the secant map of MM. We analyse the geometrical properties of the secant caustic of a planar curve, i.e. the number of branches of the secant caustic, the parity of the number of cusps and the number of inflexion points in each branch of thi…

2018-02-28abs ↗pdf ↗

We investigate the secant dimensions and the identifiablity of flag varieties parametrizing flag of sub vector spaces of a fixed vector space. We give numerical conditions ensuring that secant varieties of flag varieties have the expected dimension, and that a general point on these secant varieties is identifiable.

2019-12-02abs ↗pdf ↗

A mathematical paradox shows secant planes don't always form a tangent plane, but some analogies hold with a specific vector product.

problem Secant planes of a two-variable smooth function do not always form a tangent plane, even for simple polynomials.
method Analogies with the one-variable case are explored, using Clifford's geometric vector product.
result Some analogies with the one-variable case still hold in the multi-variable context with a specific vector product.

The paper studies flow lines on Higgs bundle moduli spaces, classifying them via secant varieties.

problem Classifying flow lines on moduli spaces of Higgs bundles.
method Gradient flow lines for L2L^2 norm of Higgs field, Morse-theoretic compactification, secant varieties.
result Flow lines have an algebro-geometric classification via secant varieties.

Fix a straight line L in Euclidean 3-space and consider the fibration of the complement of L by half-planes. A generic knot K in the complement of L has neither fiber quadrisecants nor fiber extreme secants such that K touches the corresponding half-plane at 2 points. Both types of secants occur in generic isotopies of…

2007-01-30abs ↗pdf ↗

New approach uses secants to improve sensor placement and feature selection for nonlinear systems.

problem Inadequacy of linear methods for minimal sensor placement and feature selection in nonlinear systems.
method Data-driven approach using secant vectors to develop greedy algorithms for robust, near-minimal reconstruction guarantees.
result Demonstrated on two problems where linear techniques fail, secant-based approach provides robust solutions.

New GP-based MIL method using Hyperbolic Secant distribution.

problem Probabilistic MIL for medical image analysis.
method Formulate VGPMIL using Pólya-Gamma random variables.
result Competitive or superior predictive performance and efficiency.

Paper proves PI consensus algorithm converges exponentially under restricted secant inequality.

problem Proving convergence of PI consensus algorithm without convexity.
method Lyapunov theory, restricted secant inequality, rate-matching discretization, local pre-conditioning.
result Exponential convergence of PI consensus algorithm for non-convex functions.

Plots show miscalibration directly as slopes of secant lines.

problem Detecting discrepancies between probabilistic predictions and actual outcomes.
method Cumulative differences between observed and expected values displayed as slopes of secant lines.
result Directly shows miscalibration without binning or kernel density estimation.

Study explores geometric structure and prior for beta-logistic distribution.

problem Understanding the geometric structure and prior distributions of the beta-logistic distribution.
method Exploring dual geometric structure and uncovering α\alpha-parallel prior.
result The beta-logistic distribution admits an α\alpha-parallel prior for any real number α\alpha.

We introduce a method to produce bounds for the non secant defectivity of an arbitrary irreducible projective variety, once we know how its osculating spaces behave in families and when the linear projections from them are generically finite. Then we analyze the relative dimension of osculating projections of Grassmann…

2016-10-28abs ↗pdf ↗

We consider projective varieties with degenerate Gauss image whose focal hypersurfaces are non-reduced schemes. Examples of this situation are provided by the secant varieties of Severi and Scorza varieties. The Severi varieties are moreover characterized by a uniqueness property.

2003-04-09abs ↗pdf ↗

New method models portfolios with leptokurtic risk factors using Gram-Charlier expansions.

problem Modeling portfolios with excess kurtosis.
method GC-like expansions of the hyperbolic-secant law to account for leptokurtosis.
result Portfolio distribution with risk factors modeled as GC-like expansions of the HS law.

A lightweight framework improves convergence and stability of PINNs for complex PDEs.

problem Training instability and reduced accuracy in PINNs for complex PDEs.
method Adaptive curvature correction using secant information to optimize first-order optimizers.
result Consistent improvements in convergence speed, stability, and accuracy over standard optimizers.

Let SVdnSV^{\pmb n}_{\pmb d} be the Segre-Veronese given as the image of the embedding induced by the line bundle OPn1××Pnr(d1,,dr)\mathcal{O}_{\mathbb{P}^{n_1}\times\dots\times\mathbb{P}^{n_r}}(d_1,\dots, d_r). We prove that asymptotically SVdnSV^{\pmb n}_{\pmb d} is not hh-defective for hn1log2(d1)h\leq n_1^{\lfloor \log_2(d-1)\rfloor}.

2016-11-05abs ↗pdf ↗

The main result of this paper is a construction of solutions to the reverse Yang-Mills-Higgs flow converging in the CC^\infty topology to a critical point. The construction uses only the complex gauge group action, which leads to an algebraic classification of the isomorphism classes of points in the unstable set of a…

2016-05-19abs ↗pdf ↗

The distortion of a curve measures the maximum arc/chord length ratio. Gromov showed any closed curve has distortion at least pi/2 and asked about the distortion of knots. Here, we prove that any nontrivial tame knot has distortion at least 5pi/3; examples show that distortion under 7.16 suffices to build a trefoil kno…

2004-09-22abs ↗pdf ↗

Proposes a new method for optimizing large-scale models using Nyström approximation of the Hessian.

problem Optimizing non-convex functions like deep learning models using second-order methods.
method Nyström-approximated curvature for stochastic optimization of large-scale empirical risk minimization.
result The proposed method achieves performance competitive with state-of-the-art first-order and stochastic quasi-Newton methods.

A quadrisecant of a knot is a straight line intersecting the knot at four points. If a knot has finitely many quadrisecants, one can replace each subarc between two adjacent secant points by the line segment between them to get the quadrisecant approximation of the original knot. It was conjectured that the quadrisecan…

2016-05-02abs ↗pdf ↗

The restricted Boltzmann machine is a graphical model for binary random variables. Based on a complete bipartite graph separating hidden and observed variables, it is the binary analog to the factor analysis model. We study this graphical model from the perspectives of algebraic statistics and tropical geometry, starti…

2009-08-30abs ↗pdf ↗

This manuscript proposes a probabilistic framework for algorithms that iteratively solve unconstrained linear problems Bx=bBx = b with positive definite BB for xx. The goal is to replace the point estimates returned by existing methods with a Gaussian posterior belief over the elements of the inverse of BB, which can …

2014-02-10abs ↗pdf ↗

Let XX be a smooth irreducible nondegenerate projective variety and let XX^* denote its dual variety. It is well known that σ2(X)σ_2(X)^*, the dual of the 2-secant variety of XX, is a component of the singular locus of XX^*. The locus of bitangent hyperplanes, i.e. hyperplanes tangent to at least two points of XX, is…

2012-06-05abs ↗pdf ↗

Stochastic gradient algorithms have been the main focus of large-scale learning problems and they led to important successes in machine learning. The convergence of SGD depends on the careful choice of learning rate and the amount of the noise in stochastic estimates of the gradients. In this paper, we propose a new ad…

2014-12-23abs ↗pdf ↗

In this paper, we study the interplay between modules and sub-objects in holomorphic Poisson geometry. In particular, we define a new notion of "residue" for a Poisson module, analogous to the Poincaré residue of a meromorphic volume form. Of particular interest is the interaction between the residues of the canonical …

2012-03-20abs ↗pdf ↗

Quantized Stochastic Primal-Dual Methods for Distributed Optimization

problem Distributed optimization with stochastic gradients and finite-bit communication
method q-PDGD, a quantized stochastic primal-dual method
result Linear contraction to an explicit neighborhood under RSI, O(1/k) convergence under PL inequality

Inference-aware meta-alignment of LLMs reduces computational cost.

problem Aligning LLMs to diverse human preferences is challenging due to conflicting criteria.
method IAMA trains a base model to be aligned to multiple tasks via different inference-time alignment algorithms, using non-linear GRPO for optimization.
result IAMA enables effective alignment of LLMs to multiple criteria with limited computational budget.

Conformal Alignment ensures trustworthy outputs from foundation models.

problem Ensuring outputs from foundation models align with human values in high-stakes tasks.
method A framework that trains an alignment predictor using reference data to select trustworthy outputs.
result Conformal Alignment accurately identifies trustworthy outputs via lightweight training over moderate reference data.

LPL optimizes embeddings to align local neighborhoods, improving cross-lingual word alignment.

problem Aligning embeddings across different datasets and languages.
method Locality Preserving Loss (LPL) optimizes model to project embeddings while maintaining local neighborhoods and aligning them.
result LPL-based alignment leads to better and consistent accuracy, especially in small training set settings.

Extends reinforcement learning alignment to scalar rewards, improving math reasoning.

problem Designing reinforcement learning algorithms for general LLM alignment.
method Introduces f-GRPO and f-HAL, estimating f-divergences between reward-aligned and unaligned distributions.
result Improves math reasoning RLVR tasks and mitigates reward hacking.

The paper addresses rigid alignment of noisy patches, providing a polynomial time algorithm and convergence conditions.

problem Finding a rigid alignment of overlapping local views (patches) that minimizes alignment error in a noisy setting.
method Characterizes non-degeneracy based on kernel and positivity of a matrix, provides polynomial time algorithm for testing non-degeneracy, and uses Riemannian gradient descent for alignment.
result The algorithm converges locally linearly to a non-degenerate perfect alignment under certain conditions.

Study connects database alignment and planted matching using Gaussian features.

problem Identify matching between correlated user features in anonymized databases.
method Derived results for database alignment and planted matching, showing connections and thresholds.
result Performance thresholds for database alignment converge to planted matching when feature dimensionality is sufficiently high.

SMAI framework tests and integrates single-cell data alignability.

problem Lack of a rigorous statistical test for alignability and distortion during alignment.
method Spectral manifold alignment and inference (SMAI) framework.
result SMAI outperforms existing methods in alignability testing and integration.

New method aligns brain data across individuals for better brain decoding.

problem Inter-individual variability in brain response patterns limits decoder generalization.
method SpectralOT method that embeds cortical geometry into Laplace-Beltrami eigenmodes.
result SpectralOT strikes balance between aligning functional features and preserving anatomical structure.