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

Trend · papers per month

5101520 · May 202019922001200920172026
48 results for Julia package

Algorithm approximates functions into manifolds with curvature bounds.

problem Approximating functions into manifolds with lower curvature bounds.
method Algorithm using manifold exponential and logarithm, with error bounds based on sectional curvature.
result Error bounds for nonnegative sectional curvature are similar to linear space approximations.

Extends DCP framework to Hadamard manifolds for geodesically convex functions.

problem Verifying convexity in nonlinear programs on Hadamard manifolds.
method Introduces Disciplined Geodesically Convex Programming (DGCP) framework, defining compositions and transformations for geodesically convex functions.
result Allows verification of geodesic convexity for a broader range of functions, including statistical estimators and matrix-valued optimization.

The generation of artificial data based on existing observations, known as data augmentation, is a technique used in machine learning to improve model accuracy, generalisation, and to control overfitting. Augmentor is a software package, available in both Python and Julia versions, that provides a high level API for th…

2017-08-11abs ↗pdf ↗

theft package simplifies feature extraction for time series analysis in R.

problem Lack of a unified access point and methodological pipelines for feature-based time series analysis.
method theft package provides a unified framework for computing features from six open-source time series feature sets.
result theft enables comprehensive quantification and interpretation of time series structure.

JULIA combines multi-linear and nonlinear models for tensor completion.

problem Complex patterns in real-world tensors require a unified model.
method JULIA unifies multi-linear and nonlinear models with flexible component assignment and efficient alternating optimization.
result JULIA outperforms existing methods in large-scale tensor completion.

Paper introduces a new Poisson kernel for strongly pseudoconvex domains.

problem Developing a new mathematical tool for strongly pseudoconvex domains.
method Introducing a maximal plurisubharmonic function called the pluricomplex Poisson kernel.
result The pluricomplex Poisson kernel shares properties with the classical Poisson kernel and reproduces pluriharmonic functions.

We extend a result regarding the Random Backward Iteration algorithm for drawing Julia sets (known to work for certain rational semigroups containing a non-Möbius element) to a class of Möbius semigroups which includes certain settings not yet been dealt with in the literature, namely, when the Julia set is not a thick…

2015-11-09abs ↗pdf ↗

We show that if PP is a quadratic polynomial with a fixed Cremer point and Julia set JJ, then for any monotone map $\ph:J\to A$ from JJ onto a locally connected continuum AA, AA is a single point.

2008-09-06abs ↗pdf ↗

This paper describes Convex, a convex optimization modeling framework in Julia. Convex translates problems from a user-friendly functional language into an abstract syntax tree describing the problem. This concise representation of the global structure of the problem allows Convex to infer whether the problem complies …

2014-10-17abs ↗pdf ↗

Study dynamics of automorphisms on cubic surfaces and their connection to Painlevé 6.

problem Dynamics of holomorphic automorphisms on cubic surfaces and their relation to Painlevé 6.
method Defined Julia and Fatou sets, studied locally discrete and non-discrete dynamics, and proved existence of non-empty Fatou and Julia sets.
result Existence of non-empty Fatou and Julia sets for the group action.

This paper deals with both complex dynamical systems and conformal iterated function systems. We study finitely generated expanding semigroups of rational maps with overlaps on the Riemann sphere. We show that if a dd-parameter family of such semigroups satisfies the transversality condition, then for almost every par…

2011-09-12abs ↗pdf ↗

We investigate the random dynamics of polynomial maps on the Riemann sphere and the dynamics of semigroups of polynomial maps on the Riemann sphere. In particular, the dynamics of a semigroup GG of polynomials whose planar postcritical set is bounded and the associated random dynamics are studied. In general, the Juli…

2011-04-19abs ↗pdf ↗

We present new rectification theorems of degenerate quasi-conformal structures that give a meaning to quotients of Riemann surfaces with empty interior "fundamental domains". These techniques are used to define the unique renormalization of polynomials with Cantor set Julia sets.

2014-05-22abs ↗pdf ↗

Let PP be a polynomial of degree dd with a Cremer point pp and no repelling or parabolic periodic bi-accessible points. We show that there are two types of such Julia sets JPJ_P. The \emph{red dwarf} JPJ_P are nowhere connected im kleinen and such that the intersection of all impressions of external angles is a cont…

2008-09-05abs ↗pdf ↗

CoinTossX is a low-latency, open-source matching engine for financial trading.

problem Efficiently matching orders in financial markets with low latency and high throughput.
method Developed in Java, orders submitted via UDP SBE, low-latency message transport (Aeron Media Driver). Separates order generation and matching.
result Demonstrated low-latency, high-throughput performance in various deployment scenarios.

The presentation of supergravity theories of our previous paper "Super-Poincare' algebras, space-times and supergravities (I)" is re-formulated in the language of Berezin-Leites-Kostant theory of supermanifolds. It is also shown that the equations of Cremmer, Julia and Scherk's theory of 11D-supergravity are equivalent…

2011-08-31abs ↗pdf ↗

A new framework for time series analysis using state-space learning.

problem Ineffectiveness of traditional Kalman filtering in handling big data and multiple explanatory variables.
method State Space Learning (SSL) framework using statistical learning for high-dimensional regression.
result SSL outperforms traditional methods in subset selection and forecasting accuracy.

R package innsight interprets deep neural networks predictions.

problem Interpreting predictions of deep neural networks.
method Unified and user-friendly framework implementing feature attribution methods for neural networks, independent of deep learning library.
result Offers a variety of visualization tools for tabular, signal, image data or a combination.

An infinite family of generalized pseudo-Anosov homeomorphisms of the sphere S is constructed, and their invariant foliations and singular orbits are described explicitly by means of generalized train tracks. The complex strucure induced by the invariant foliations is described, and is shown to make S into a complex sp…

2003-07-15abs ↗pdf ↗

The public package registry npm is one of the biggest software registry. With its 216 911 software packages, it forms a big network of software dependencies. In this paper we evaluate various methods for finding similar packages in the npm network, using only the structure of the graph. Namely, we want to find a way of…

2016-02-11abs ↗pdf ↗