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

1223 · Sep 201819922001200920172026
48 results for constant-speed ramps

The paper finds that circles and logarithmic spirals are the only constant-speed ramps for a specific force field.

problem Determining planar curves for constant-speed motion under specific force conditions.
method Analyzing the motion of a particle under friction and a central force field.
result Every solution to the constant-speed motion problem approaches either a circle or a logarithmic spiral.

In this paper we show all possible ramps where an object can move with constant speed under the effect of gravity and friction. The planar ramp are very easy to describe, just rotate a curve with velocity vector (tanh(as),sech(as)). Recall that tanh(as)^2+sech^2(as) = 1. Therefore, the solution of the planar constant s…

2013-05-02abs ↗pdf ↗

Study develops a machine learning-based ramp metering model to improve freeway efficiency.

problem Improving ramp metering to maintain freeway efficiency under various traffic conditions.
method Machine learning approach using historical data to predict and manage traffic flow.
result The novel model outperforms a baseline traffic-responsive ramp metering algorithm.

Traditional plane-based clustering methods measure the cost of within-cluster and between-cluster by quadratic, linear or some other unbounded functions, which may amplify the impact of cost. This letter introduces a ramp cost function into the plane-based clustering to propose a new clustering method, called ramp-base…

2018-12-10abs ↗pdf ↗

Study improves adversarial classification using distributionally robust models.

problem Improving robustness against adversarial attacks in classification models.
method Distributionally robust chance constraints with Wasserstein ambiguity, reformulated as a regularized ramp loss minimization problem.
result Standard descent methods can converge to the global minimizer for the distributionally robust adversarial classification model.

In this paper we propose a tractable quadratic programming formulation for calculating the equilibrium term structure of electricity prices. We rely on a theoretical model described in [21], but extend it so that it reflects actually traded electricity contracts, transaction costs and liquidity considerations. Our nume…

2014-09-23abs ↗pdf ↗

Seesaw optimizes training by balancing learning rate and batch size, accelerating model pretraining.

problem Optimizing training efficiency for large language models with adaptive optimizers.
method Develops a principled framework for batch-size scheduling, introducing Seesaw which multiplies learning rate by 1/√2 and doubles batch size.
result Empirically, Seesaw reduces wall-clock time by approximately 36% compared to cosine decay, matching theoretical limits.

Automates detection of fast-ramped flexibility events for DSOs.

problem Monitoring and supervising flexibility activations in power systems.
method Unsupervised detection and open-set classification.
result Automatically identifies critical flexibility activations for early intervention.

Bayesian methods have been successfully applied to sparsify weights of neural networks and to remove structure units from the networks, e. g. neurons. We apply and further develop this approach for gated recurrent architectures. Specifically, in addition to sparsification of individual weights and neurons, we propose t…

2018-12-12abs ↗pdf ↗

Let f f^{\star} be a function on Rd \mathbb{R}^d with an assumption of a spectral norm vf v_{f^{\star}} . For various noise settings, we show that Ef^f2(vf4logdn)1/3 \mathbb{E}\|\hat{f} - f^{\star} \|^2 \leq \left(v^4_{f^{\star}}\frac{\log d}{n}\right)^{1/3} , where n n is the sample size and f^ \hat{f} is either a penalized lea…

2016-07-05abs ↗pdf ↗

We study dynamic hedging of counterparty risk for a portfolio of credit derivatives. Our empirically driven credit model consists of interacting default intensities which ramp up and then decay after the occurrence of credit events. Using the Galtchouk-Kunita-Watanabe decomposition of the counterparty risk price paymen…

2017-09-04abs ↗pdf ↗

The study generalizes Minkowski inequalities for curves on surfaces.

problem Generalizing Minkowski inequalities for curves on Riemannian surfaces.
method Introducing a generalized Minkowski average using parametrized curves and proving the inequality for constant-speed curves.
result A family of constant-speed curves on a Riemannian surface satisfies the Brunn-Minkowski inequality with respect to the Riemannian area form if and only if the geodesic curvature is determined by a function κ satisfying a specific inequality.

Active learning is an important technique to reduce the number of labeled examples in supervised learning. Active learning for binary classification has been well addressed in machine learning. However, active learning of the reject option classifier remains unaddressed. In this paper, we propose novel algorithms for a…

2019-06-14abs ↗pdf ↗

Here we propose a general theoretical method for analyzing the risk bound in the presence of adversaries. Specifically, we try to fit the adversarial learning problem into the minimax framework. We first show that the original adversarial learning problem can be reduced to a minimax statistical learning problem by intr…

2018-11-13abs ↗pdf ↗

In this paper, we systemally study the long time behavior of the curve shortening flow in a closed or non-compact complete locally Riemannian symmetric manifold. Assume that we have a global flow. Then we can exhibit a a limit for the global behavior of the flow. In particular, we show the following results. 1). Let $\…

2003-12-26abs ↗pdf ↗

A Finsler space (M,F)(M,F) is called a geodesic orbit space if any geodesic of constant speed is the orbit of a one-parameter subgroup of isometries of (M,F)(M, F). In this paper, we study Finsler metrics on Euclidean spaces which are geodesic orbit metrics. We will show that, in this case (M,F)(M, F) is a fiber bundle over a s…

2018-07-09abs ↗pdf ↗

Case study shows impact of co-optimizing energy and reserve for wind energy.

problem Impact of lack of co-optimization of energy and reserve in high wind penetration scenarios.
method Developed two models with and without co-optimization, calibrated with Spanish market parameters.
result Models show significant differences in energy and reserve management.

Structured learning is appropriate when predicting structured outputs such as trees, graphs, or sequences. Most prior work requires the training set to consist of complete trees, graphs or sequences. Specifying such detailed ground truth can be tedious or infeasible for large outputs. Our main contribution is a large m…

2012-06-27abs ↗pdf ↗

The paper proposes a method for generating uniform interpolations on data manifolds.

problem Generating high-quality interpolations between data samples on complex manifolds.
method Autoencoder network with interpolation network, regularized by a Riemannian metric.
result The method generates interpolations that remain within the manifold's distribution.

In a recent paper, Alfonsi, Fruth and Schied (AFS) propose a simple order book based model for the impact of large orders on stock prices. They use this model to derive optimal strategies for the execution of large orders. We apply these strategies to an agent-based stochastic order book model that was recently propose…

2009-04-27abs ↗pdf ↗

Ray tracing sampler improves neural network sampling efficiency and resilience.

problem Sampling neural network posterior distributions efficiently and robustly.
method Markov Chain Monte Carlo using ray tracing through likelihood space.
result Significantly higher resilience to gradient heating compared to HMC.

New method combines FMEA and Bayesian Network for root cause analysis in lithium-ion battery production.

problem Complex cause-effect relationships in lithium-ion battery production.
method Combining FMEA with Bayesian Network to detect and resolve inconsistencies.
result Holistic method builds large-scale cross-process Bayesian Failure Network for root cause analysis.

Through multi-agent competition, the simple objective of hide-and-seek, and standard reinforcement learning algorithms at scale, we find that agents create a self-supervised autocurriculum inducing multiple distinct rounds of emergent strategy, many of which require sophisticated tool use and coordination. We find clea…

2019-09-17abs ↗pdf ↗

The paper studies hybrid connections on Hessian manifolds and their properties.

problem Investigating hybrid connections on Hessian manifolds.
method Defining and analyzing hybrid connections as incompressible affine connections projective to a flat connection DD.
result The difference ablaD abla - D is determined by the logarithmic differential of a Hessian potential function.

SPADE improves demand forecasting accuracy by 4.5% for post-promotion periods.

problem Overreacting to peak events in demand forecasting leads to biased forecasts.
method SPADE splits forecasting into two tasks: one for peak events and another for post-peak events, using masked convolution filters and a specialized Peak Attention module.
result Overall PPE improvement of 4.5%, 30% improvement for most affected forecasts after promotions and holidays, and 3.9% improvement in PE accuracy.

Deep neural nets on 1-D data are convex Lasso models with reflection features.

problem Training neural networks on 1-D data.
method Proving equivalence to convex Lasso problems with discrete, explicitly defined dictionary matrices.
result Reflection features in neural networks with certain activations.

SLERP interpolation optimizes dynamic weight rebalancing in AMMs.

problem Optimizing dynamic weight rebalancing in automated market makers (AMMs).
method Riemannian geometry and SLERP interpolation.
result SLERP interpolation minimizes the KL divergence loss in dynamic weight rebalancing.

The paper examines A/B tests in recommendation systems to detect biased algorithm comparisons due to shared data.

problem Bias in comparing recommendation algorithms due to shared data.
method Formalized as a multi-armed bandit problem, analyzed the sign of difference-in-means estimator vs true GTE.
result Data sharing can lead to biased comparisons of recommendation algorithms, and a detection procedure is proposed.

As automotive electronics continue to advance, cars are becoming more and more reliant on sensors to perform everyday driving operations. These sensors are omnipresent and help the car navigate, reduce accidents, and provide comfortable rides. However, they can also be used to learn about the drivers themselves. In thi…

2017-06-09abs ↗pdf ↗

This paper characterizes and designs loss functions for robust classification with abstention.

problem Ensuring robustness against adversarial attacks and knowing when to abstain from prediction.
method Proposes adversarial robust reject option loss and characterizes surrogates for calibration.
result Shifted Double Ramp Loss and Shifted Double Sigmoid Loss satisfy the calibration conditions.