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

77155232309 · Jun 202019922001200920172026
48 results for rebate design

Study optimizes rebate design in auction markets to enhance efficiency.

problem Designing optimal rebate policies in auction markets to improve efficiency.
method Formulated as a principal-agent problem, solved using Hamilton-Jacobi-Bellman equations and Deep BSDE method.
result Optimal transaction fees and rebates narrow the price spread, improving market efficiency.

A new AMM design reduces impermanent loss and retains more liquidity.

problem Inefficiencies in conventional AMM designs lead to liquidity loss and user engagement issues in DEXs.
method Proposes a dual-mechanism framework: a power-law invariant BMM and dynamic rebate system.
result Reduces impermanent loss by 36% and retains 3.98x more liquidity during price volatility.

Maker-taker fees can prevent algorithmic cooperation in market making, but not always.

problem Unexpected cooperation among independent algorithms in market making.
method Modeling market making as a repeated game, experimental analysis of transaction costs and rebates.
result Maker-taker fee models can destabilize cooperation, but not always with a specific relationship between costs and rebates.

Paper explains adversarial training's robust overfitting through a minimax game perspective.

problem Adversarial training suffers from robust overfitting after learning rate decay.
method Viewing adversarial training as a dynamic minimax game, analyzing how LR decay breaks balance and leads to overfitting.
result ReBalanced Adversarial Training (ReBAT) alleviates robust overfitting without sacrificing robustness.

In this paper, we propose stock trading based on the average tax basis. Recall that when selling stocks, capital gain should be taxed while capital loss can earn certain tax rebate. We learn the optimal trading strategies with and without considering taxes by reinforcement learning. The result shows that tax ignorance …

2019-07-28abs ↗pdf ↗

We show how to price and replicate a variety of barrier-style claims written on the log\log price XX and quadratic variation X\langle X \rangle of a risky asset. Our framework assumes no arbitrage, frictionless markets and zero interest rates. We model the risky asset as a strictly positive continuous semimartingale w…

2015-08-04abs ↗pdf ↗

Lewis and Mordecki have computed the Wiener-Hopf factorization of a Lévy process whose restriction on ]0,+[]0,+\infty[ of their Lévy measure has a rational Laplace transform. That allows to compute the distribution of (Xt,inf0stXs)(X_t,\inf_{0\leq s\leq t}X_s). For the same class of Lévy processes, we compute the distribution of $ (…

2010-03-25abs ↗pdf ↗

This paper deals with a high-order accurate implicit finite-difference approach to the pricing of barrier options. In this way various types of barrier options are priced, including barrier options paying rebates, and options on dividend-paying-stocks. Moreover, the barriers may be monitored either continuously or disc…

2007-09-29abs ↗pdf ↗

Efficient semi-analytic methods for pricing double barrier options with time-dependent parameters.

problem Pricing and calibration of double barrier options with time-dependent parameters.
method Two approaches: General Integral transform method and Heat Potential method.
result Semi-analytic techniques are more efficient for pricing double barrier options than traditional numerical methods.

To execute a trade, participants in electronic equity markets may choose to submit limit orders or market orders across various exchanges where a stock is traded. This decision is influenced by the characteristics of the order flow and queue sizes in each limit order book, as well as the structure of transaction fees a…

2012-10-05abs ↗pdf ↗

A framework for faster, better infographic design by non-experts and experts alike.

problem Designing infographics is time-consuming and tedious for non-experts and even professionals.
method Semi-automated infographic framework for structured and flow-based designs, including automatic design ranking and customization options.
result Designers from all expertise levels can generate generic infographic designs faster than existing methods while maintaining quality.

The paper proposes a method to reliably select design algorithms for machine learning-guided design tasks.

problem Choosing the right design algorithm for machine learning-guided design tasks.
method Combining designs' predicted property values with held-out labeled data to reliably forecast characteristics of the label distributions produced by different design algorithms.
result The method is guaranteed to return design algorithms that yield successful label distributions.

We propose a new low-cost machine-learning-based methodology which assists designers in reducing the gap between the problem and the solution in the design process. Our work applies reinforcement learning (RL) to find the optimal task-oriented design solution through the construction of the design action for each task.…

2019-03-13abs ↗pdf ↗

MO-PaDGAN generates diverse, high-performance designs with multiple metrics.

problem Challenges in generating diverse, high-performance designs with multiple metrics.
method MO-PaDGAN uses a new Determinantal Point Processes based loss function for probabilistic modeling of diversity and performances.
result MO-PaDGAN expands the design space towards high-performance regions and generates new designs with high diversity and performances.

MCD automates counterfactual design searches for multi-modal tasks.

problem Designing for multi-objective goals and complex constraints.
method Model-agnostic counterfactual search method for multi-modal design modifications.
result MCD streamlines and automates counterfactual search, recommending effective design modifications.

PaDGAN generates diverse, high-quality designs with improved performance.

problem Lack of diversity and performance improvement in generated designs.
method Integrates Determinantal Point Processes for diversity and quality, using GAN framework.
result PaDGAN generates higher quality designs with better diversity and without mode collapse.

ANN with GA optimizes flexible disc design for lower mass and stress.

problem Design flexible disc elements for lower mass and stress without compromising torque transmission and misalignment.
method Artificial Neural Network (ANN) coupled with Genetic Algorithm (GA) for design exploration.
result Optimized designs meet specified criteria with minimum mass and stress.

New method for mixed-variable GSA improves material design efficiency.

problem Designing materials with both quantitative and qualitative variables.
method Integrates LVGP with Sobol' analysis for mixed-variable GSA.
result Accelerates exploration of novel MOF candidates in combinatorial design spaces.

Efficient deep learning computing requires algorithm and hardware co-design to enable specialization: we usually need to change the algorithm to reduce memory footprint and improve energy efficiency. However, the extra degree of freedom from the algorithm makes the design space much larger: it's not only about designin…

2019-04-24abs ↗pdf ↗

DAD learns to design experiments quickly, outperforming traditional methods.

problem Real-time decision-making in sequential Bayesian experimental design.
method Amortized design network trained with contrastive information bounds.
result DAD outperforms alternative strategies on various problems.

Enhances scenario approach for certifying design properties post-design.

problem Certifying additional useful properties in designs not considered during the design phase.
method Two-level framework of appropriateness: baseline and post-design. Distribution-free upper bounds on risk derived.
result Distribution-free upper bounds on the risk of failing to meet post-design appropriateness.

MO-PaDGAN improves multi-objective optimization by generating diverse and high-performing designs.

problem Challenges in parameterizing engineering designs for multi-objective optimization.
method MO-PaDGAN uses a generative adversarial network with a Determinantal Point Processes loss function to address these challenges.
result MO-PaDGAN generates designs with improved performance and coverage, even surpassing training data.

Generative thermal design learns optimal shapes using multi-agent reinforcement learning.

problem Complex thermal design challenges due to convection-diffusion equation and boundary interactions.
method Cooperative multi-agent deep reinforcement learning with continuous geometric representation.
result Framework learns optimal design strategies without shape derivation or differentiable objectives.

Paper proposes NASAIC framework for co-designing neural architectures and heterogeneous ASICs.

problem Designing efficient neural architectures and ASICs for multiple tasks.
method Build ASIC templates and propose NASAIC framework for simultaneous design of architectures and ASICs.
result NASAIC ensures design specifications and maximizes accuracy with minimal performance loss.

Adaptive designs achieve strong Neyman regret guarantees for ATE estimation.

problem Estimating unbiased average treatment effect in sequential experiments.
method Proposed adaptive designs with O~(logT)\widetilde{O}(\log T) Neyman regret under boundedness assumptions and O~(T)\widetilde{O}(\sqrt{T}) multigroup Neyman regret in covariate-based settings.
result Adaptive designs outperform non-adaptive designs in terms of Neyman regret, especially in covariate-based settings.

iDAD uses neural networks to quickly adapt experiments without likelihoods.

problem Performing adaptive experiments in real-time with implicit models.
method iDAD learns a design policy network upfront to make quick design decisions.
result iDAD can make design decisions in milliseconds, unlike traditional BOED approaches.

Unified framework for combinatorial and rounding algorithms in experimental design.

problem Designing and analyzing combinatorial and rounding algorithms for experimental design problems.
method Local search framework for combinatorial algorithms and regret minimization framework for rounding algorithms.
result Unified approach to match and improve all known results in D/A/E-design and obtain new results in unknown settings.

A new method achieves optimal uniformity in designs with minimal flexibility.

problem Achieving optimal uniformity in designs with minimal flexibility.
method Derive a lower bound on the uniformity constant and use a greedy construction to achieve this bound, then extend the scheme for more flexibility.
result A simple greedy construction achieves the optimal uniformity constant.

RID-Noise improves robust design under noisy conditions using neural networks.

problem Design robustness under noisy environments.
method Robust Inverse Design under Noise (RID-Noise) using conditional invertible neural networks (cINNs).
result RID-Noise achieves more effective robust design compared to state-of-the-art methods.

Dataset of 4500 bicycle designs aids in design analysis and synthesis.

problem Identify gaps in bicycle market and design space, classify bicycles, synthesize new designs.
method Processed dataset, unsupervised dimensionality reduction, supervised classification, machine learning synthesis.
result Identified design parameters and factors influencing bicycle classification.

Layout design with complex constraints is a challenging problem to solve due to the non-uniqueness of the solution and the difficulties in incorporating the constraints into the conventional optimization-based methods. In this paper, we propose a design method based on the recently developed machine learning technique,…

2018-06-07abs ↗pdf ↗

New deep learning method simplifies parameter estimation design.

problem Optimal experimental design for parameter estimation with non-linear systems.
method Training a deep network as a Likelihood Free Estimator to simplify design process.
result Deep design improves parameter recovery quality and simplifies design process.