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.

169,341 papers · 148 categories

Trend · papers per month

171341512682 · Jun 202019922001200920182026
48 results for offset complexity measures

We address the problem of curvature estimation from sampled compact sets. The main contribution is a stability result: we show that the gaussian, mean or anisotropic curvature measures of the offset of a compact set K with positive μμ-reach can be estimated by the same curvature measures of the offset of a compact set…

2008-12-07abs ↗pdf ↗

This paper tackles denoising of complex measures using optimal transport and curvature analysis.

problem Denoising of complex, possibly non-log-concave measures.
method Score function and optimal transport theory to revert Langevin diffusion chains.
result The difficulty of denoising depends on the curvature complexity of the initial measure at specific SNR scales.

In this paper, we study Mannheim surface offsets in dual space. By the aid of the E. Study Mapping, we consider ruled surfaces as dual unit spherical curves and define the Mannheim offsets of the ruled surfaces by means of dual geodesic trihedron (dual Darboux frame). We obtain the relationships between the invariants …

2011-10-05abs ↗pdf ↗

In this paper, using the classifications of timelike and spacelike ruled surfaces, we study the Mannheim offsets of timelike ruled surfaces in Minkowski 3-space. Firstly, we define the Mannheim offsets of a timelike ruled surface by considering the Lorentzian casual character of the offset surface. We obtain that the M…

2009-06-11abs ↗pdf ↗

Study mirrors descent's early stopping for linear and kernel models, improving risk guarantees.

problem Understanding the statistical performance of early-stopped mirror descent algorithms.
method Characterized convexity of squared loss, identified link between offset Rademacher complexities and mirror descent convergence.
result Excess risk guarantees for mirror descent iterates traced by the path, expressed in terms of offset complexities.

The paper introduces gapped scale-sensitive dimensions to improve learning rate bounds.

problem Improving lower bounds on rates of convergence in statistical and online learning.
method Introducing and analyzing gapped scale-sensitive dimensions for function classes.
result Gapped dimensions lead to stronger lower bounds on offset Rademacher averages.

This study examines geometric properties and offsets of slant timelike-ruled surfaces.

problem Geometric properties and offsets of slant timelike-ruled surfaces in Minkowski 3-space.
method Derivation of parametric formulation, conditions for coaxial alignment, examination through Blaschke and Darboux frames.
result Conditions ensuring the coaxial alignment of the central normal with the ruling direction of the offset surface.

In this paper, we study Bertrand surface offsets by considering the dual geodesic trihedron(dual Darboux frame) of the ruled surfaces. We obtain the relationships between the invariants of Bertrand trajectory ruled surfaces. Furthermore, we obtain the conditions for these surface offset to be developable.

2011-08-23abs ↗pdf ↗

This research uses reinforcement learning to find optimal emission offsets in greenhouse gas markets.

problem Finding optimal emission offsets in greenhouse gas markets to control excess emissions.
method Utilized reinforcement learning, specifically Nash-DQN, to estimate market Nash equilibria.
result Emitting firms can achieve significant financial savings by abiding by the Nash equilibria found in the market.

Paper presents neural network controllers for offset-free setpoint tracking.

problem Offset-free setpoint tracking using neural network controllers.
method Exploiting slope-restricted activation functions, linear matrix inequalities are used to verify stability.
result Global and local stability conditions for neural network controllers are derived.

In this study, we define some new types of ruled surfaces called slant ruled surfaces. We give some characterizations for a regular ruled surface to be a slant ruled surface in Euclidean 3- space. We show that if the slant ruled surface is developable then the striction curve is a general helix or a slant helix accordi…

2013-11-04abs ↗pdf ↗

Locality-sensitive hashing converts high-dimensional feature vectors, such as image and speech, into bit arrays and allows high-speed similarity calculation with the Hamming distance. There is a hashing scheme that maps feature vectors to bit arrays depending on the signs of the inner products between feature vectors a…

2012-12-26abs ↗pdf ↗

This work models GHG offset credit markets to find optimal strategies for market participants.

problem Optimizing GHG offset credit markets to reduce emissions and penalize excess emissions.
method Characterized optimal behavior in single-player and two-player GHG offset credit markets using optimal stopping and control problems, and mixed-Nash equilibria.
result Market participants benefit from optimal OC trading and generation, highlighting the importance of acting optimally.

This work analyzes centered binary Restricted Boltzmann Machines (RBMs) and binary Deep Boltzmann Machines (DBMs), where centering is done by subtracting offset values from visible and hidden variables. We show analytically that (i) centering results in a different but equivalent parameterization for artificial neural …

2013-11-06abs ↗pdf ↗

A new diffusion model tackles brightness issues with a probabilistic approach.

problem Brightness-related limitations in diffusion models.
method Introduces a novel diffusion model with a probabilistic framework, modifying both forward and reverse diffusion processes.
result The model mitigates brightness-related limitations and improves performance in high-dimensional settings.

Since risky positions in multivariate portfolios can be offset by various choices of capital requirements that depend on the exchange rules and related transaction costs, it is natural to assume that the risk measures of random vectors are set-valued. Furthermore, it is reasonable to include the exchange rules in the a…

2013-01-08abs ↗pdf ↗

Paper investigates neural query graph ranking for complex question answering over knowledge graphs.

problem Improving neural models for complex question answering over knowledge graphs.
method Experimented with six ranking models, proposed a self-attention based slot matching model.
result Proposed model outperforms other models on DBpedia QA datasets.

Automated vowel duration measurement improves on manual methods.

problem Manual vowel duration annotation is time-consuming and inconsistent.
method Structured prediction framework; acoustic feature functions; learning algorithm to minimize duration error.
result Trained model outperforms HMM-based aligner in automatic duration estimation.

Gradient descent in logistic regression converges to the maximum margin predictor.

problem Convergence and risk of logistic regression parameters.
method Gradient descent applied to logistic regression.
result Gradient descent iterates converge to the maximum margin predictor at a rate of O(lnlnt/lnt)\mathcal{O}(\ln\ln t / \ln t).

Study predicts lens performance using neural networks.

problem Predicting visual acuity from lens designs.
method Used a CNN to classify Landolt Cs and validate its ability to predict VA from induced defocus.
result Validation showed consistent offset of +0.20 logMAR from simulated VA, comparable to clinical repeatability.

Reinforcement learning improves wireless systems' rate adaptation.

problem Optimizing rate adaptation in 4G/5G systems using ACK/NACK feedback.
method Formulated as a Multi-Armed Bandit problem, proposed binary search algorithm with PAC guarantees.
result Achieved PAC solution for OLLA with binary search, outperforming UCB methods.

The paper introduces new measures for ovals and finds geometric relations between their properties.

problem Understanding the properties of ovals and their measures.
method Introducing new measures (Constant Width Measure Set, Spherical Measure Set) and studying their geometrical properties.
result Exact relations between the length, area, and oriented areas of ovals and their measures.

In this paper, we have studied the pricing of a continuously collateralized CDS. We have made use of the "survival measure" to derive the pricing formula in a straightforward way. As a result, we have found that there exists irremovable trace of the counter party as well as the investor in the price of CDS through thei…

2011-04-11abs ↗pdf ↗

This paper examines multifractal dynamics in cryptocurrencies using two methodologies.

problem Understanding the multifractal nature of cryptocurrencies and their stochastic processes.
method Two alternative multi-scaling methodologies applied to 84 cryptocurrencies.
result Cryptocurrencies exhibit different degrees of long-range dependence and stochastic processes.

Continuous state spaces and stochastic, switching dynamics characterize a number of rich, realworld domains, such as robot navigation across varying terrain. We describe a reinforcementlearning algorithm for learning in these domains and prove for certain environments the algorithm is probably approximately correct wit…

2012-06-13abs ↗pdf ↗