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

59117176234 · May 202619922001200920172026
48 results for local offset

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.

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 ↗

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 ↗

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.

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 ↗

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 ↗

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 method for spotting symbols in CAD images reduces annotation costs and improves accuracy.

problem Challenging task of labeling symbols from CAD drawings.
method Pixel-wise point location via Progressive Gaussian Kernels (PGK) and local offset.
result The proposed method achieves good generalization on real-world CAD images.

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.

Spectrum sensing is of critical importance in any cognitive radio system. When the primary user's signal has uncertain parameters, the likelihood ratio test, which is the theoretically optimal detector, generally has no closed-form expression. As a result, spectrum sensing under parameter uncertainty remains an open qu…

2019-07-15abs ↗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.

Gradient descent, when applied to the task of logistic regression, outputs iterates which are biased to follow a unique ray defined by the data. The direction of this ray is the maximum margin predictor of a maximal linearly separable subset of the data; the gradient descent iterates converge to this ray in direction a…

2018-03-20abs ↗pdf ↗

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.

LEAPS samples discrete distributions via CTMCs and locally equivariant networks.

problem Sampling from discrete distributions with known normalization.
method Continuous-time Markov chain, locally equivariant functions, attention layers, convolutional networks.
result LEAPS minimizes the variance of importance weights, improving sampling efficiency.

BN refines local partition geometry in piecewise-affine networks during training.

problem Understanding the effect of BN on the function realized during training in piecewise-affine networks.
method Analyzing the geometry of switching hyperplanes and affine-region partition conditioned on a mini-batch.
result BN increases expected local partition refinement in ReLU and piecewise-affine networks.

We propose an algorithm for electrocardiogram (ECG) segmentation using a UNet-like full-convolutional neural network. The algorithm receives an arbitrary sampling rate ECG signal as an input, and gives a list of onsets and offsets of P and T waves and QRS complexes as output. Our method of segmentation differs from oth…

2020-01-14abs ↗pdf ↗

This paper presents a distributionally robust Q-Learning algorithm (DrQ) which leverages Wasserstein ambiguity sets to provide idealistic probabilistic out-of-sample safety guarantees during online learning. First, we follow past work by separating the constraint functions from the principal objective to create a hiera…

2020-02-07abs ↗pdf ↗

We advance the state of the art in polyphonic piano music transcription by using a deep convolutional and recurrent neural network which is trained to jointly predict onsets and frames. Our model predicts pitch onset events and then uses those predictions to condition framewise pitch predictions. During inference, we r…

2017-10-30abs ↗pdf ↗

Recently there has been a surge of interest in understanding implicit regularization properties of iterative gradient-based optimization algorithms. In this paper, we study the statistical guarantees on the excess risk achieved by early-stopped unconstrained mirror descent algorithms applied to the unregularized empiri…

2020-02-01abs ↗pdf ↗

Study adapts OHLC volatility estimators for monitoring market stress in diverse settings.

problem Limited use of range-based volatility estimators in local commodity markets.
method Adapted OHLC volatility estimators to monitor market distress across various contexts.
result OHLC-based volatility indicators detect market disruptions missed by standard momentum indicators.

We propose a general framework for studying adaptive regret bounds in the online learning framework, including model selection bounds and data-dependent bounds. Given a data- or model-dependent bound we ask, "Does there exist some algorithm achieving this bound?" We show that modifications to recently introduced sequen…

2015-08-21abs ↗pdf ↗

In the present paper we study normal transport surfaces in four-dimensional Euclidean space E4\mathbb{E}^{4} which are the generalization of surface offsets in E3\mathbb{E}^{3}. We find some results of normal transport surfaces in E4\mathbb{E}^{4} of evolute and parallel type. Further, we give some examples of these ty…

2014-12-10abs ↗pdf ↗

New method calibrates photometric redshift PDFs more accurately.

problem Inaccurate photometric redshift uncertainties lead to systematic errors.
method Local re-calibration using feature-space regression of Probability Integral Transform (PIT) distributions.
result Calibrated PDFs are more accurate at all locations in feature space.

Through a short sale, a person borrows a share of stock from a lender, sells the borrowed share to a third person at the current price, and purchases an identical share in the market at a future date and at a future price to replace the borrowed share of stock. This only makes sense if the short seller anticipates a do…

2017-12-28abs ↗pdf ↗

New method uses neural networks for accurate angle estimation in noisy conditions.

problem Accurately estimate angles from noisy measurements in various applications.
method Directed Graph Neural Networks (GNNSync) for end-to-end trainable framework.
result GNNSync achieves competitive performance, even at high noise levels.