arXiv research

In this paper, we define dual geodesic trihedron(dual Darboux frame) of a spacelike ruled surface. Then, we study Mannheim offsets of spacelike ruled surfaces in dual Lorentzian space by considering the E. Study Mapping. We represent spacelike ruled surfaces by dual Lorentzian unit spherical curves and define Mannheim …

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 …

In this paper, using the classifications of timelike and spacelike ruled surfaces, we define and study the Mannheim offsets of spacelike ruled surfaces in Minkowski 3-space. We give the conditions for spacelike offset surfaces to be developable.

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.

In this paper, we introduce the dual geodesic trihedron (dual Darboux frame) of a timelike ruled surface. By the aid of the E. Study Mapping, we consider timelike ruled surfaces as dual hyperbolic spherical curves and define the Mannheim offsets of timelike ruled surfaces by means of dual Darboux frame. We obtain the r…

The paper generalizes offset Rademacher complexities to convex and non-convex problems.

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

New bounds for non-convex estimators without Bernstein condition.

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

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…

Transfer learning for causal forest

In this study, we give the dual characterizations of Mannheim offsets of the ruled surface in terms of their integral invariants and the new characterization of the Mannheim offsets of developable surface. Furthermore, we obtain the relationships between the area of projections of spherical images for Mannheim offsets …

In this paper, we obtain the characterizations of Mannheim offsets of the timelike ruled surface with spacelike rulings in dual Lorentzian space. We give the relations between terms of their integral invariants and also we give the new characterization of the Mannheim offsets of developable timelike ruled surface. More…

Often noisy point clouds are given as an approximation of a particular compact set of interest. A finite point cloud is a compact set. This paper proves a reconstruction theorem which gives a sufficient condition, as a bound on the Hausdorff distance between two compact sets, for when certain offsets of these two sets …

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

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…

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…

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…

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

We consider regression with square loss and general classes of functions without the boundedness assumption. We introduce a notion of offset Rademacher complexity that provides a transparent way to study localization both in expectation and in high probability. For any (possibly non-convex) class, the excess loss of a …

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…

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 …

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

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…

A new perspective on self-attention models using MLPs.

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…

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…

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

We consider the problem of optimal investment in a market with two cointegrated stocks and an agent with CRRA utility. We extend the findings of Liu and Timmermann [The Review of Financial Studies, 26(4):1048-1086, 2013] by paying special attention to when/if the associated stochastic control problem is well-posed and …

Wireless systems perform rate adaptation to transmit at highest possible instantaneous rates. Rate adaptation has been increasingly granular over generations of wireless systems. The base-station uses SINR and packet decode feedback called acknowledgement/no acknowledgement (ACK/NACK) to perform rate adaptation. SINR i…

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…

Italian banks use swaps to hedge against rising interest rates, offsetting losses on debt securities.

New method offsets DML's error-compounding issue and provides more stable causal parameter estimates.

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…

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

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…

Paper uses SAC RL to optimize market-making strategies.

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

Model analyzes RFQ markets using stochastic control to optimize dealer performance and inventory.

Estimates sample size for subgroup analysis in randomized experiments.

Dematerialization is the reduction in the quantity of materials needed to produce something useful over time. Dematerialization fundamentally derives from ongoing increases in technical performance but it can be counteracted by demand rebound - increases in usage because of increased value (or decreased cost) that also…

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…

New approach predicts event probabilities for better event detection.

Optimal fees protect passive LPs in AMMs under varying market conditions.

Paper solves trade-off between internalisation and externalisation in stochastic trade flows.

We study efficient deep learning training algorithms that process received wireless signals, if a test Signal to Noise Ratio (SNR) estimate is available. We focus on two tasks that facilitate source identification: 1- Identifying the modulation type, 2- Identifying the wireless technology and channel in the 2.4 GHz ISM…

Empirical studies show that the volatility may exhibit correlations that decay as a fractional power of the time offset. The paper presents a rigorous analysis for the case when the stationary stochastic volatility model is constructed in terms of a fractional Ornstein Uhlenbeck process to have such correlations. It is…

Deep learning (DL) based autoencoder has shown great potential to significantly enhance the physical layer performance. In this paper, we present a DL based autoencoder for interference channel. Based on a characterization of a k-user Gaussian interference channel, where the interferences are classified as different le…