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

4284125167 · Jun 202019922001200920172026
48 results for billing codes

Study finds billing codes at IPO boost digital health companies' financial performance.

problem Identifying factors that drive long-term financial success in digital health companies.
method Analyzed 33 digital health IPOs from 2010-2021, comparing companies with and without billing codes.
result Companies with billing codes at IPO were significantly more likely to achieve positive CAGR and higher market capitalization.

The paper analyzes sterling bills of exchange during the first globalization, revealing their global financial role.

problem Understanding the global financial role of sterling bills of exchange during the first globalization.
method Descriptive statistics and network analysis of a unique data set of 23,493 bills re-discounted by the Bank of England in 1906.
result Sterling bills of exchange had a truly global dimension and were crucial for overcoming information asymmetries.

This study shows how trade policy uncertainty affects stock-T bill correlations.

problem The impact of trade policy uncertainty on stock-T bill relationships.
method Extended Dynamic Conditional Correlation (DCC) framework incorporating exogenous variables.
result Trade policy uncertainty significantly alters stock-T bill correlations, especially under specific political conditions.

Article explores Thurston's circle packing theorem in 3-manifold geometry.

problem Understanding Thurston's circle packing theorem in 3-manifold geometry.
method Analyzes the Koebe-Andre'ev-Thurston Theorem and its relation to Thurston's circle packing theorem.
result Illustrates the significance of Thurston's circle packing theorem in 3-manifold geometry.

Here we shall consider a very popular practical applied problem of managing mode switching (in this work we are considering managing billing plans). Out of the two parties (service provider and service consumer), participating in the processes modelled here, we shall consider only a consumer type of a problem. Herein w…

2015-09-19abs ↗pdf ↗

Two machine learning models detect anomalies in ER claims, saving up to 40% in improper payments.

problem Improper health insurance payments from fraud and upcoding.
method Two machine learning models: an upcoding model based on severity code distributions and a random forest model for claim sorting.
result Random forest model saved 12% to 40% in improper payments compared to a baseline approach.

Automatic bill classification is an attractive task with many potential applications such as automated detection and counting in images or videos. To address this purpose we present a Deep Learning Model to classify Chilean Banknotes, because of its successful results in image processing applications. For optimal perfo…

2019-12-21abs ↗pdf ↗

We give a unified geometric approach to some theorems about primitive elements and palindromes in free groups of rank 2. The geometric treatment gives new proofs of the theorems. Dedicated to Bill Harvey on his 65th birthday.

2008-03-03abs ↗pdf ↗

The study explores machine learning for predicting customer propensity-to-pay uncertainty.

problem Improving customer experience, reducing financial hardship, and managing cash flow risks.
method Investigated machine learning models for predicting propensity-to-pay, focusing on uncertainty estimation.
result Novel Bayesian Neural Network model for binary classification of propensity-to-pay.

This note summarizes in an informal way some geometric properties of Anosov representations into the symplectic group, which were presented in a talk at the conference What is Next. The mathematical legacy of Bill Thurston, held in June 2014 in Cornell.

2016-02-10abs ↗pdf ↗

This document consists of the collection of handouts for a two-week summer workshop entitled 'Geometry and the Imagination', led by John Conway, Peter Doyle, Jane Gilman and Bill Thurston at the Geometry Center in Minneapolis, June 17-28, 1991. The workshop was based on a course `Geometry and the Imagination' which we …

2018-04-09abs ↗pdf ↗

In this manuscript we analyse the leading statistical properties of fluctuations of (log) 3-month US Treasury bill quotation in the secondary market, namely: probability density function, autocorrelation, absolute values autocorrelation, and absolute values persistency. We verify that this financial instrument, in spit…

2007-06-08abs ↗pdf ↗

Optimal control of reserve assets for stablecoins to maintain peg stability.

problem Balancing immediate liquidity and yield on reserve assets for stablecoin peg maintenance.
method Developed a stochastic model predictive control framework with moment closure for event intensities, incorporating a soft-thresholding structure for rebalancing.
result Optimal policy shifts predictably toward cash as expected outflows intensify or windows lengthen, preserving most bill carry in calm markets and quickly building cash during stress.

We propose a multifractal model for short-term interest rates. The model is a version of the Markov-Switching Multifractal (MSM), which incorporates the well-known level effect observed in interest rates. Unlike previously suggested models, the level-MSM model captures the power-law scaling of the structure functions a…

2011-11-22abs ↗pdf ↗

OOM-RL uses financial market losses to align AI agents in autonomous systems.

problem Constrained alignment of autonomous software agents in live financial markets.
method Deploying agents in live financial markets to enforce strict test-driven workflows.
result Final OOM-RL-aligned system achieved a stable equilibrium with an annualized Sharpe ratio of 2.06.

Study refines trend-following strategy to improve adaptability.

problem Challenges in practical implementation of historical trend-following strategies.
method Modifications to historical strategy, including T-bills exclusion, alternative allocations, industry exclusions, momentum signals, and Walk-Forward Analysis.
result Persistent challenges in adapting historical strategies to modern markets.

Donoho's JCGS (in press) paper is a spirited call to action for statisticians, who he points out are losing ground in the field of data science by refusing to accept that data science is its own domain. (Or, at least, a domain that is becoming distinctly defined.) He calls on writings by John Tukey, Bill Cleveland, and…

2017-10-24abs ↗pdf ↗

We investigate the macroeconomic consequences of narrow banking in the context of stock-flow consistent models. We begin with an extension of the Goodwin-Keen model incorporating time deposits, government bills, cash, and central bank reserves to the base model with loans and demand deposits and use it to describe a fr…

2018-10-12abs ↗pdf ↗

New evidence supports the Euler class one conjecture for tight contact structures.

problem Euler class one conjecture for taut foliations and tight contact structures.
method Analysis of tight contact structures and counterexamples to the conjecture.
result Counterexamples to the Euler class one conjecture for taut foliations are also Euler classes of tight contact structures.

Many software analysis methods have come to rely on machine learning approaches. Code segmentation - the process of decomposing source code into meaningful blocks - can augment these methods by featurizing code, reducing noise, and limiting the problem space. Traditionally, code segmentation has been done using syntact…

2019-07-18abs ↗pdf ↗

Traffic classification has various applications in today's Internet, from resource allocation, billing and QoS purposes in ISPs to firewall and malware detection in clients. Classical machine learning algorithms and deep learning models have been widely used to solve the traffic classification task. However, training s…

2019-06-12abs ↗pdf ↗

Contrastive Code Representation Learning improves code summarization and type inference.

problem Code representations are sensitive to edits, hindering downstream semantic understanding tasks.
method ContraCode: a contrastive pre-training task that learns code functionality.
result Contrastive pre-training improves code summarization and type inference accuracy.

Investigates neural codes and their embeddings, proving conjectures and introducing new code types.

problem Analyzing neural codes and their embedding dimensions.
method Combinatorial, topological, and algebraic analysis; proving conjectures; introducing new neural code types.
result Proves conjectures about neural codes and their embeddings, introduces new code types.

Characterization of a patient clinical phenotype is central to biomedical informatics. ICD codes, assigned to inpatient encounters by coders, is important for population health and cohort discovery when clinical information is limited. While ICD codes are assigned to patients by professionals trained and certified in c…

2018-11-28abs ↗pdf ↗

Sparse coding approximates the data sample as a sparse linear combination of some basic codewords and uses the sparse codes as new presentations. In this paper, we investigate learning discriminative sparse codes by sparse coding in a semi-supervised manner, where only a few training samples are labeled. By using the m…

2013-11-26abs ↗pdf ↗

Inspired by recent work on convex formulations of clustering (Lashkari & Golland, 2008; Nowozin & Bakir, 2008) we investigate a new formulation of the Sparse Coding Problem (Olshausen & Field, 1997). In sparse coding we attempt to simultaneously represent a sequence of data-vectors sparsely (i.e. sparse approximation (…

2012-05-09abs ↗pdf ↗

Topological theory for qLDPC codes enables non-Clifford gates and magic state injection.

problem Fault-tolerant quantum computation in qLDPC codes with non-Clifford gates and magic state resources.
method Developed a topological theory using simplicial or CW complex structures and deformation retraction.
result Achieved non-Clifford gates and magic state injection in qLDPC codes with constant rate and polynomial distance.

We introduce new definitions of universal and superuniversal computable codes, which are based on a code's ability to approximate Kolmogorov complexity within the prescribed margin for all individual sequences from a given set. Such sets of sequences may be singled out almost surely with respect to certain probability …

2009-01-15abs ↗pdf ↗