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

Trend · papers per month

96192288384 · Jun 202019922001200920172026
48 results for rectangular bounding

Rectangular Bounding Process (RBP) improves partitioning efficiency in multi-dimensional spaces.

problem Creating many unnecessary divisions in sparse regions when describing dense regions.
method Introduces Rectangular Bounding Process (RBP) to efficiently partition multi-dimensional spaces using a bounding strategy.
result The RBP is self-consistent and can be extended to infinite space, offering rich yet parsimonious expressiveness.

Paper studies S-rectangular DR-RL models for robust reinforcement learning with near-optimal sample complexity.

problem Addressing distributional discrepancies in reinforcement learning environments.
method Empirical value iteration algorithm for divergence-based S-rectangular DR-RL models.
result Near-optimal sample complexity bound of O(SA(1γ)4ε2)O(|\mathcal{S}||\mathcal{A}|(1-γ)^{-4}\varepsilon^{-2}).

Study non-rectangular robust MDPs for average-reward, finding optimal policies and transient values.

problem Non-rectangular robust Markov decision processes under average-reward criterion.
method Proves history-dependent policies are robust-optimal, introduces transient-value framework, constructs epoch-based policy.
result Existence and properties of robust optimal policies, transient value bounds.

Researchers extend knot theory formulas to non-rectangular cases.

problem Applying universal-matrix precursor formulas to non-rectangular knot representations.
method Reformulated previously known formulas for simplest non-rectangular representations [r,1].
result Demonstrated drastic simplification of formulas after reformulation.

Study extends bounds on sample covariance matrices with general dependence.

problem Quantitative bounds on sample covariance matrices with i.i.d. columns.
method Extends previous work on deterministic equivalent to rectangular random matrices with general dependence structure.
result Proves quantitative bounds involving dimensions and spectral parameter, including closer proximity to real positive semi-line.

If a rectangular diagram represents the trivial knot, then it can be deformed into the rectangular diagram with only two vertical edges by a finite sequence of merge operations and exchange operations, without increasing the number of vertical edges, which was shown by I. A. Dynnikov. We show in this paper that we need…

2013-03-27abs ↗pdf ↗

In this paper Legendrian graphs in (R3,ξst)(\mathbb{R}^3,ξ_{\mathrm{st}}) are considered modulo Legendrian isotopy and edge contraction. To a Legendrian graph we associate a (generalized) rectangular diagram --- a purely combinatorial object. Moves of rectangular diagrams are introduced so that equivalence classes of Legendr…

2014-12-06abs ↗pdf ↗

We introduce a simple combinatorial way, which we call a rectangular diagram of a surface, to represent a surface in the three-sphere. It has a particularly nice relation to the standard contact structure on S3\mathbb S^3 and to rectangular diagrams of links. By using rectangular diagrams of surfaces we are going, in p…

2016-06-10abs ↗pdf ↗

Study reveals 1/f1/f noise in signals made from nonoverlapping rectangular pulses.

problem Analyzing 1/f1/f noise in signals composed of nonoverlapping pulses.
method Derived a general formula for power spectral density, analyzed rectangular pulse case.
result Observed pure 1/f1/f noise until very low frequencies with long pulse durations.

A correspondence is studied by H. Matsuda between front projections of Legendrian links in the standard contact structure for 3-space and rectangular diagrams. In this paper, we introduce braided rectangular diagrams, and study a relationship with Legendrian links in the standard contact structure for 3-space. We show …

2007-08-17abs ↗pdf ↗

New framework for higher-order singular-value derivatives of rectangular matrices.

problem Challenging to derive higher-order Fréchet derivatives of singular values in real rectangular matrices.
method Using Kato's analytic perturbation theory for self-adjoint operators and embedding rectangular matrices into block self-adjoint operators.
result Closed-form expressions for the nn-th order spectral variations of singular values.

Paper studies robust MDPs, improving sample complexity and asymptotic performance.

problem Optimal robust policy and value function in robust MDPs with generative models.
method Improves prior results on non-asymptotic and asymptotic performances of robust MDPs, considering various uncertainty sets.
result Improved sample complexity and asymptotic normality of optimal robust value function.

Factorization of the differential expansion coefficients for HOMFLY-PT polynomials of double braids, discovered in arXiv:1606.06015 in the case of rectangular representations RR, is extended to the first non-rectangular representations R=[2,1]R=[2,1] and R=[3,1]R=[3,1]. This increases chances that such factorization will take p…

2016-12-01abs ↗pdf ↗

We elaborate on the recent observation that evolution for twist knots simplifies when described in terms of triangular evolution matrix B{\cal B}, not just its eigenvalues ΛΛ, and provide a universal formula for B{\cal B}, applicable to arbitrary rectangular representation R=[rs]R=[r^s]. This expression is in terms of s…

2019-02-11abs ↗pdf ↗

GD and NAG accelerate matrix factorization and neural networks.

problem Optimizing rectangular matrix factorization and linear neural networks.
method Gradient descent and Nesterov's accelerated gradient with specific initialization.
result NAG achieves the best-known iteration complexity for these problems.

Optimal unimodal fitting for linear loss functions in a sequential, efficient manner.

problem Optimal unimodal transformation of univariate model scores under linear loss functions.
method Proposes a sequential approach to estimate the optimal rectangular fit for observed samples with each new sample.
result Sequential approach achieves optimal efficiency with logarithmic time complexity per iteration.

Square Clifford torus uniquely determined by isoperimetric ratio, rectangular torus not.

problem Uniqueness of 3D shape of rectangular Clifford torus based on isoperimetric ratio.
method Closed-form formulas for isoperimetric ratio of stereographic projection, strict monotonicity.
result Isoperimetric ratio does not uniquely determine rectangular Clifford torus shape.

The (stochastic) gradient descent and the multiplicative update method are probably the most popular algorithms in machine learning. We introduce and study a new regularization which provides a unification of the additive and multiplicative updates. This regularization is derived from an hyperbolic analogue of the entr…

2019-02-05abs ↗pdf ↗

New methods for multivariate nonparametric regression reduce dimensionality issues.

problem Nonparametric regression in high dimensions with covariates.
method Introduced entirely monotonic and constrained Hardy-Krause variation LSEs.
result Risk properties and minimax lower bounds for these LSEs.

Simple rectilinear polygons (i.e. rectilinear polygons without holes or cutpoints) can be regarded as finite rectangular cell complexes coordinatized by two finite dendrons. The intrinsic l1l_1-metric is thus inherited from the product of the two finite dendrons via an isometric embedding. The rectangular cell complexe…

2010-05-11abs ↗pdf ↗

We rewrite the recently proposed differential expansion formula for HOMFLY polynomials of the knot 414_1 in arbitrary rectangular representation R=[rs]R=[r^s] as a sum over all Young sub-diagrams λλ of RR with extraordinary simple coefficients Dλtr(r)Dλ(s)D_{λ^{tr}}(r)\cdot D_λ(s) in front of the ZZ-factors. Somewhat miraculously…

2016-09-01abs ↗pdf ↗

Various semigroups of noninvertible supermatrices of the special (antitriangle) shape having nilpotent Berezinian which appear in supersymmetric theories are defined and investigated. A subset of them continuously represents left and right zero semigroups and rectangular bands. The ideal properties of higher order rect…

1996-09-19abs ↗pdf ↗

Rectangular diagrams of links are link diagrams in the plane R2{\mathbb R}^2 such that they are composed of vertical line segments and horizontal line segments and vertical segments go over horizontal segments at all crossings. P. R. Cromwell and I. A. Dynnikov showed that rectangular diagrams of links are useful for d…

2014-05-27abs ↗pdf ↗

We study immersed tori in 33-space minimizing the Willmore energy in their respective conformal class. Within the rectangular conformal classes   (0,b)  \;(0,b)\; with   b1  \;b \sim 1\; the homogenous tori   fb  \;f^b\; are known to be the unique constrained Willmore minimizers (up to invariance). In this paper we generalize this r…

2017-10-02abs ↗pdf ↗

New algorithm for signal estimation in noisy matrix models.

problem Signal estimation in rectangular spiked matrix models with rotationally invariant noise.
method Orthogonal Approximate Message Passing (OAMP) algorithm for signal estimation.
result Optimal OAMP algorithm minimizes mean-squared error and achieves Bayes-optimal performance.

We address the rectangular matrix completion problem by lifting the unknown matrix to a positive semidefinite matrix in higher dimension, and optimizing a nonconvex objective over the semidefinite factor using a simple gradient descent scheme. With O(μr2κ2nmax(μ,logn))O( μr^2 κ^2 n \max(μ, \log n)) random observations of a $n_1 \times n…

2016-05-23abs ↗pdf ↗

In an earlier paper we introduced rectangular diagrams of surfaces and showed that any isotopy class of a surface in the three-sphere can be presented by a rectangular diagram. Here we study transformations of those diagrams and introduce moves that allow transition between diagrams representing isotopic surfaces. We a…

2017-12-18abs ↗pdf ↗