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

36912 · Jun 202019922001200920172026
48 results for Buffer zones

Proportional transaction costs present difficult theoretical problems in trading algorithm design, on account of their lack of analytical tractability. The author derives a solution of DT-NT-DT form for an arbitrary model in which the the traded asset has diffusive dynamics described by one or more stochastic risk fact…

2012-04-29abs ↗pdf ↗

Secure aggregation for buffered asynchronous federated learning without TEEs.

problem Privacy and convergence in buffered asynchronous federated learning.
method Developed a new protocol (BASecAgg) that ensures privacy without TEEs by carefully designing masks.
result BASecAgg achieves similar convergence guarantees as FedBuff without TEEs.

We introduce a Markovian single point process model, with random intensity regulated through a buffer mechanism and a self-exciting effect controlling the arrival stream to the buffer. The model applies the principle of the Hawkes process in which point process jumps generate a shot-noise intensity field. Unlike the Ha…

2017-10-10abs ↗pdf ↗

Brillouin zones were introduced by Brillouin in the thirties to describe quantum mechanical properties of crystals, that is, in a lattice in Rn\R^n. They play an important role in solid-state physics. It was shown by Bieberbach that Brillouin zones tile the underlying space and that each zone has the same area. We gene…

1998-06-29abs ↗pdf ↗

Machine learning predicts CO2 emissions in power grids, reducing uncertainty.

problem Forecasting CO2 emission intensities in power grids.
method Developed a machine learning algorithm using LASSO, feature selection, and Softmax weighted average.
result Marginal emissions are independent of DK2 zone conditions, suggesting external generators.

A new buffer system improves continual learning in RL agents by adapting to changing environments.

problem Improving RL agents' ability to learn from changing environments over time.
method Multi-timescale replay buffer combined with invariant risk minimization.
result The method shows improvement over baselines in continual learning settings.

Study shows critical width for rigidity of equatorial zones on spheres.

problem Mean curvature rigidity of equatorial zones on spheres.
method Used tangency principle and trap-slice lemma for strong rigidity, and constructed nontrivial perturbations using Delaunay surfaces for non-rigidity.
result Critical width exists for rigidity, beyond which zones are non-rigid.

For a given lattice, we establish an equivalence involving a closed zone of the corresponding Voronoi polytope, a lamina hyperplane of the corresponding Delaunay partition and a quadratic form of rank 1 being an extreme ray of the corresponding L-type domain.

2000-04-01abs ↗pdf ↗

The Zone of Avoidance makes it difficult for astronomers to catalogue galaxies at low latitudes to our galactic plane due to high star densities and extinction. However, having a complete sky map of galaxies is important in a number of fields of research in astronomy. There are many unclassified sources of light in the…

2019-03-06abs ↗pdf ↗

Model predicts and optimizes trading of electricity price spreads across multiple zones.

problem Forecasting and optimizing day-ahead versus real-time price spreads in U.S. electricity markets.
method Unified statistical model for positive and negative spikes, structural price impact model based on bid stacks.
result Optimal trading strategy improves risk-return profile and highlights market heterogeneity.

Optimizes portfolio with two controls to minimize trades and maintain signal integrity.

problem Optimizing a single-asset portfolio with transaction costs and signal autocorrelation.
method Formulated an optimization problem to minimize trades while maintaining signal integrity and achieving maximum return.
result Locally optimal solution minimizes trades and achieves maximum return, with a quantifiable improvement based on threshold and autocorrelation removed.

New research shows many recent defenses against adversarial examples are ineffective against black-box attacks.

problem The robustness of recent defenses against adversarial examples is insufficient, especially against black-box attacks.
method Evaluation of nine defenses on two black-box adversarial models and six attacks on CIFAR-10 and Fashion-MNIST datasets.
result Most recent defenses provide only marginal improvements in security (<25%<25\%) compared to undefended networks.

CoDeQ simplifies joint model compression by integrating pruning and quantization.

problem Joint pruning and quantization methods are complex and require additional procedures.
method CoDeQ uses a dead-zone quantizer to directly induce sparsity and learn quantization parameters.
result CoDeQ achieves high sparsity and low-precision accuracy with minimal bit operations.

Regulator allocates buffers to prevent financial contagion in networks with common assets.

problem Containment of default contagion in financial networks with common asset exposures.
method Allocates nonnegative buffer vectors under linear budget constraints to maximize default or insolvency resilience margins or minimize worst-case systemic losses.
result Exact synthesis results for buffer allocation under \ell_{\infty} and 1\ell_{1} uncertainty sets, showing significant gains over uniform and exposure-proportional allocations.

In the present paper which a sequel to dg-ga/9511005 and dg-ga//9610013 a global Weierstrass representation of an arbitrary closed oriented surface of genus 1\geq 1 in the the three-space is constructed. The Weierstrass spectrum of a torus immersed into R3R^3 is introduced and finite-zone planes as well as finite-zone…

1997-10-20abs ↗pdf ↗

We study the problem of optimal trading using general alpha predictors with linear costs and temporary impact. We do this within the framework of stochastic optimization with finite horizon using both limit and market orders. Consistently with other studies, we find that the presence of linear costs induces a no-tradin…

2015-01-15abs ↗pdf ↗

Study reveals different drivers of electricity price volatility across Europe.

problem Understanding the drivers of electricity price volatility across different European zones.
method Developed estimators of weekly integrated variance using a stochastic partial differential equation approach, accounting for mean-reversion and semigroup-smoothing.
result Each European generation zone has distinct drivers of volatility, and leverage effects are not generally asymmetric.

Efficiently combines autoregressive and set-based models for joint distributions.

problem Joint distributions over multiple predictions from set-based models.
method Causal autoregressive buffer that caches context and captures dependencies.
result Up to 20x faster joint sampling and density evaluation, up to 7x lower memory usage.

Algorithm finds safe zones in policy Markov Decision Processes to limit trajectory escape.

problem Finding safe zones in policy Markov Decision Processes to limit trajectory escape.
method Bi-criteria approximation learning algorithm with polynomial sample complexity.
result Achieves almost 2 approximation for both escape probability and safe zone size.

The paper proposes a method to learn from both simulation and real-world data.

problem Training autonomous systems in simulation and applying them to real-world environments.
method Balancing samples from simulation and real-world data using a replay buffer.
result The method achieves better performance in real-world tasks compared to training only in simulation.

Unified principle LZN unifies generative modeling, representation learning, and classification.

problem Disjoint solutions for generative modeling, representation learning, and classification.
method LZN creates a shared latent space for all tasks, using encoders and decoders for each data type.
result LZN improves FID on CIFAR10 and outperforms existing methods in representation learning and joint generation/classification.

MER algorithm speeds up VI solving with Markovian data.

problem Solving stochastic variational inequalities with Markovian data.
method MER algorithm using multi-scale sampling from a Markovian buffer.
result Achieves faster convergence without knowing Markov chain mixing time.

State space models (SSMs) provide a flexible framework for modeling complex time series via a latent stochastic process. Inference for nonlinear, non-Gaussian SSMs is often tackled with particle methods that do not scale well to long time series. The challenge is two-fold: not only do computations scale linearly with t…

2019-01-29abs ↗pdf ↗

A mean-reverting financial instrument is optimally traded by buying it when it is sufficiently below the estimated `mean level' and selling it when it is above. In the presence of linear transaction costs, a large amount of value is paid away crossing bid-offers unless one devises a `buffer' through which the price mus…

2011-03-25abs ↗pdf ↗

Adopting a zonal structure of electricity market requires specification of zones' borders. In this paper we use social welfare as the measure to assess quality of various zonal divisions. The social welfare is calculated by Market Coupling algorithm. The analyzed divisions are found by the usage of extended Locational …

2014-05-05abs ↗pdf ↗

Investigates multi-period portfolio optimization for DC plans using buffered Probability of Exceedance.

problem Optimizing long-term Defined Contribution plans with realistic constraints and dynamic dynamics.
method Formulates and solves bilevel optimization problems for pre-commitment and time-consistent Mean-bPoE and Mean-CVaR portfolio optimization.
result Time-consistent Mean-bPoE strategies maintain investor preferences for minimum terminal wealth, unlike Mean-CVaR.

In this note we discuss - in what is intended to be a pedagogical fashion - FX option pricing in target zones with attainable boundaries. The boundaries must be reflecting. The no-arbitrage requirement implies that the differential (foreign minus domestic) short-rate is not deterministic. When the band is narrow, we ca…

2015-12-04abs ↗pdf ↗

A continual learning agent learns online with a non-stationary and never-ending stream of data. The key to such learning process is to overcome the catastrophic forgetting of previously seen data, which is a well known problem of neural networks. To prevent forgetting, a replay buffer is usually employed to store the p…

2019-03-20abs ↗pdf ↗

DAC enhances exploration in reinforcement learning with entropy regularization.

problem Improving exploration efficiency in reinforcement learning.
method Sample-aware entropy regularization using replay buffer action distributions.
result DAC significantly outperforms existing algorithms in reinforcement learning tasks.

Central bank strategy to maintain currency exchange rate within limits.

problem Maintaining a currency exchange rate within a target zone despite adverse economic trends.
method Modeling the problem with a continuous-time market impact model and solving it as a stochastic control problem.
result Optimal strategy minimizes accumulated inventory of foreign currency.

Our analysis of financial data, in terms of super-exponential growth, suggests that the seed of the 2002/03 crisis of the Dutch supermarket giant AHOLD was planted in 1996. It became quite visible in 1999 when the post-bubble destabilization regime was well-developed and acted as the precursor of an inevitable collapse…

2004-03-22abs ↗pdf ↗

Optimal trading strategy with predictor and costs, derived equations and shape.

problem Optimal trading strategy in presence of price predictor, costs, and risk control.
method Path-integral method to derive equations for band edges, solved explicitly for Ornstein-Uhlenbeck predictor.
result Explicit equations and shape of the optimal band strategy derived and analyzed.

Continual learning is the problem of learning new tasks or knowledge while protecting old knowledge and ideally generalizing from old experience to learn new tasks faster. Neural networks trained by stochastic gradient descent often degrade on old tasks when trained successively on new tasks with different data distrib…

2018-11-28abs ↗pdf ↗