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

Trend · papers per month

1234 · Jun 202219922001200920172026
48 results for gears

A relatively common sight in graphic designs is a planar arrangement of three gears in contact. However, since neighboring gears must rotate in opposite directions, none of the gears can move. We give a non-planar, and non-frozen, arrangement of three linked gears.

2013-04-25abs ↗pdf ↗

A pair of noncircular gears can be used to generate a strictly increasing continuous function ψ(φ)ψ(\varphi) whose derivative ψ(φ)=dψ(φ)/dφ>0ψ'(\varphi) = \mathrm{d}ψ(\varphi)/\mathrm{d}\varphi > 0 is 2π/n2π/n-periodic, where φ\varphi and γ=ψ(φ)γ= ψ(\varphi) are the angles of the opposite rotation directions of the drive gear and the driv…

2019-05-07abs ↗pdf ↗

GEAR uses auxiliary data to estimate optimal decisions in studies with limited primary outcomes.

problem Estimating optimal decisions when primary outcomes are not available in experimental samples.
method GEAR uses augmented inverse propensity weighting to estimate optimal decisions based on auxiliary data.
result GEAR estimators and value estimators have established asymptotic properties and are validated in simulations and a real application.

Investigates portfolio optimization with and without gearing constraints.

problem Improving portfolio weights for better alignment with expected returns.
method Extends the alpha-weight angle bound to include gearing constraints and uses theoretical arguments and simulations.
result Equally weighted portfolios are not preferable to mean-variance portfolios even with poor forecast ability and a badly conditioned covariance matrix.

The paper finds optimal ways to combine ETFs to minimize costs for investors.

problem Finding the best combination of ETFs to match a target gearing ratio at the lowest expense.
method Linear programming and convex geometry to prove the two-fund theorem for ETFs.
result The cheapest way to achieve a target gearing ratio is by combining the two nearest undominated ETF products.

Combining simple elements from the literature, we define a linear model that is geared toward sparse data, in particular implicit feedback data for recommender systems. We show that its training objective has a closed-form solution, and discuss the resulting conceptual insights. Surprisingly, this simple model achieves…

2019-05-08abs ↗pdf ↗

This paper develops a cohomological hierarchy for bistable visual paradoxes.

problem Understanding the hierarchy of visual paradoxes built from bistable elements.
method Develops a cohomological hierarchy using Z2\mathbb{Z}_2 coefficients and a discrete Stokes theorem.
result Reveals a hierarchy of paradox classes from H0H^0 through H2H^2, refined at each degree by the relative/absolute distinction.

This article provides a version of scale calculus geared towards a notion of (nonlinear) Fredholm maps between certain types of Frechet spaces, retaining as many as possible of the properties Fredholm maps between Banach spaces enjoy, and the existence of a constant rank theorem for such maps. It does so by extending t…

2016-02-23abs ↗pdf ↗

Variational inference lies at the core of many state-of-the-art algorithms. To improve the approximation of the posterior beyond parametric families, it was proposed to include MCMC steps into the variational lower bound. In this work we explore this idea using steps of the Hamiltonian Monte Carlo (HMC) algorithm, an e…

2016-09-26abs ↗pdf ↗

We study a simple model of an asset market with informed and non-informed agents. In the absence of non-informed agents, the market becomes information efficient when the number of traders with different private information is large enough. Upon introducing non-informed agents, we find that the latter contribute signif…

2010-04-28abs ↗pdf ↗

Paper introduces ML for rare-event prediction in patent quality estimation.

problem Lack of predictive modeling in econ, management, tech forecasting.
method Introduces ML approach for optimizing predictive performance.
result Demonstrates synergy between ML and inferential statistics.

We give complete algorithms and source code for constructing (multilevel) statistical industry classifications, including methods for fixing the number of clusters at each level (and the number of levels). Under the hood there are clustering algorithms (e.g., k-means). However, what should we cluster? Correlations? Ret…

2016-07-17abs ↗pdf ↗

Four new methods for computing generalized chi-square distribution.

problem Computing the generalized chi-square distribution accurately and efficiently.
method Two exact and two approximate methods, with software for cdf, pdf, and inverse cdf.
result Comparison of methods' accuracy and speed, identifying best for different cases.

Abstract perspective on quadratic programming for optimal portfolio allocation.

problem Optimal allocation problems in long portfolio theory.
method Using maximum principles and distinguished boundaries in reproducing kernel Hilbert spaces.
result Support of an optimal distribution lies in a variety intersecting a distinguished boundary.

The chapter compares Gaussian process models for stochastic simulators with varying noise.

problem Modeling stochastic simulators with varying noise.
method Various Gaussian process models are compared, including input varying noise variance, non-Gaussian noise, and quantile modeling.
result Sequential design procedures are adapted for these models.

Study examines impact of missing data on multi-armed bandit algorithms.

problem Impact of missing data on performance of multi-armed bandit algorithms.
method Extensive simulation study of two-armed bandit algorithms with binary outcomes, considering different probabilities of missingness.
result Impact on performance varies depending on the balance between exploration and exploitation.

We present ADMM-Softmax, an alternating direction method of multipliers (ADMM) for solving multinomial logistic regression (MLR) problems. Our method is geared toward supervised classification tasks with many examples and features. It decouples the nonlinear optimization problem in MLR into three steps that can be solv…

2019-01-27abs ↗pdf ↗

Modern federated networks, such as those comprised of wearable devices, mobile phones, or autonomous vehicles, generate massive amounts of data each day. This wealth of data can help to learn models that can improve the user experience on each device. However, the scale and heterogeneity of federated data presents new …

2018-12-03abs ↗pdf ↗

In this paper we present a connection between two dynamical systems arising in entirely different contexts: one in signal processing and the other in biology. The first is the famous Iteratively Reweighted Least Squares (IRLS) algorithm used in compressed sensing and sparse recovery while the second is the dynamics of …

2016-01-12abs ↗pdf ↗

Agents acting in the natural world aim at selecting appropriate actions based on noisy and partial sensory observations. Many behaviors leading to decision mak- ing and action selection in a closed loop setting are naturally phrased within a control theoretic framework. Within the framework of optimal Control Theory, o…

2014-06-27abs ↗pdf ↗

New rules control false discoveries in online anomaly detection for time series data.

problem Controlling false discoveries in anomaly detection for time series data.
method Novel online false discovery rate control (FDRC) rules for time series anomaly detection.
result Ensures high power in detecting anomalies even when the alternative is rare and test statistics are serially dependent.

This paper analyzes the profitability of selfish mining on blockchain, considering the risk of ruin.

problem The profitability of selfish mining on blockchain, considering the risk of ruin.
method Formulated a stochastic model and used tools from applied probability and analysis to determine expected profit.
result Explicit expressions for expected profit under different scenarios were derived, identifying conditions for selfish mining as a strategic advantage.

Paper proposes HCDC to improve hyperparameter search efficiency.

problem Poor generalizability of dataset condensation across different hyperparameters.
method HCDC algorithm that matches hyperparameter gradients for synthetic validation dataset.
result HCDC effectively maintains validation-performance rankings of models.

New method for discrete-time survival analysis with competing risks.

problem Discrete failure time data in survival analysis.
method Proposes a new estimation procedure for discrete-time survival analysis with competing events.
result Offers advantages over existing procedures and integrates regularized regression methods.

Surrogate models improve chemical process equipment design and optimization.

problem Design and optimization of complex chemical processes.
method Development and validation of CFD simulators, active learning strategies, and regression techniques.
result Gaussian process regression outperformed other techniques in benchmarking.

The study analyzes optimization trajectories in neural networks to reveal redundancy and redundancy-reducing strategies.

problem Understanding the directional structure and redundancy in neural network optimization.
method Introducing natural notions of complexity for optimization trajectories and analyzing their directional nature.
result Training only scalar batchnorm parameters can match the performance of training the entire network, indicating potential for hybrid optimization schemes.

A new Gaussian mechanism for differential privacy in the shuffle model is introduced.

problem Improving differential privacy in distributed learning environments.
method Characterization and upper-bounding of Rényi differential privacy (RDP) for the shuffle Gaussian mechanism.
result The shuffle Gaussian mechanism provides improved privacy guarantees compared to existing methods.

We discuss and develop some connections between analysis on singular spaces and operator algebras, as presented in my sequence of four lectures at the conference "Noncommutative geometry and applications," Frascati, Italy, June 16-21, 2014. Therefore this paper is mostly a survey paper, but the presentation is new, and…

2015-12-21abs ↗pdf ↗

New adversarial training enhances malware detectors against various attacks.

problem Vulnerability of malware detectors to evasion attacks.
method Proposes a mixture of attacks and adversarial training to improve deep neural networks.
result Significantly enhances robustness of deep neural networks against a wide range of attacks.

Credit scoring models support loan approval decisions in the financial services industry. Lenders train these models on data from previously granted credit applications, where the borrowers' repayment behavior has been observed. This approach creates sample bias. The scoring model (i.e., classifier) is trained on accep…

2019-09-13abs ↗pdf ↗

A new MPS model for both classification and generation.

problem Efficiently representing and manipulating complex, high-dimensional data.
method Inspired by Matrix Product States (MPS) used in quantum computing, applies them in a classical machine learning setting.
result Dual functionality in a supervised learning framework enhances traditional training and generates more realistic samples.

Paper proposes a new loss function for conditional models using soft targets.

problem Improving generalization performance of deep neural networks on supervised classification tasks.
method Introduces a new loss function compatible with soft targets, based on noise contrastive estimation.
result Soft target InfoNCE loss performs on par with cross-entropy baselines and outperforms other losses.