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,657 papers · 148 categories

Trend · papers per month

3571106141 · Jun 202019922001200920172026
48 results for Price Discrimination

A multi-task network avoids indirect discrimination in insurance pricing.

problem Indirect discrimination in insurance pricing models based on protected characteristics.
method Multi-task neural network architecture trained with partial protected characteristic information.
result Multi-task network produces discrimination-free insurance prices with comparable accuracy to conventional models.

This paper addresses dynamic price discrimination with fairness constraints.

problem Dynamic price discrimination with fairness constraints in online retailing.
method Nonparametric demand models, dynamic pricing policy, regret minimization.
result Optimal dynamic pricing policy with ildeO(T4/5) ilde{O}(T^{4/5}) regret for price fairness.

Paper develops methods for fair insurance pricing without direct access to sensitive attributes.

problem Fairness in insurance pricing with restricted access to sensitive attributes.
method Develops statistical methods for estimating discrimination-free premiums using privatized sensitive attributes.
result The proposed methods enable fair insurance pricing while respecting privacy and regulatory constraints.

NFT royalties boost creator earnings by sharing risk, reducing info asymmetry, and enabling price discrimination.

problem NFTs' royalties are criticized for being neutralized by speculators.
method Analyzes NFTs' royalties in various market conditions and their effects on creators.
result Royalties enable creators to capitalize on speculators' presence through risk sharing, info reduction, and price discrimination.

Model earnings call transcripts for better stock price prediction.

problem Predicting future stock price movements using earnings call transcripts.
method Deep learning framework with an attention mechanism to encode text data into vectors for predicting stock price movements.
result The proposed model outperforms traditional machine learning methods in stock price prediction.

New method reduces indirect discrimination in insurance risk models.

problem Indirect discrimination in insurance risk models using machine learning.
method Mathematical concepts of linear algebra to reduce indirect discrimination.
result Demonstrated promising performance in a concrete case of risk selection in life insurance.

The paper addresses fairness in dynamic pricing for strategic buyers.

problem Price disparities among specific groups can lead to unfair perceptions and legal violations.
method Proposes a dynamic pricing policy that achieves fairness and discourages strategic behavior.
result Achieves an upper bound of O(T+H(T))O(\sqrt{T}+H(T)) regret over TT time horizons, reducing regret by 35.06% compared to a benchmark policy.

The insurance industry uses predictions based on customer characteristics, but this can lead to discrimination. We propose using Wasserstein barycenters to mitigate biases.

problem Discrimination in insurance predictions based on sensitive features like gender or race.
method Propose using Wasserstein barycenters instead of simple scaling to mitigate biases in insurance predictions.
result Demonstrates the effectiveness of Wasserstein barycenters in mitigating biases in insurance predictions.

Retail investors set interest rates for P2P loans based on borrower characteristics.

problem Understanding how individual investors price credit risk in online consumer loan auctions.
method Reverse auction framework, analyzing interest rate variance and borrower characteristics.
result Retail investors exhibit strong predictability in pricing, with gender and marital status influencing interest rates.

This letter revisits the informational efficiency of the Bitcoin market. In particular we analyze the time-varying behavior of long memory of returns on Bitcoin and volatility 2011 until 2017, using the Hurst exponent. Our results are twofold. First, R/S method is prone to detect long memory, whereas DFA method can dis…

2017-09-23abs ↗pdf ↗

The paper analyzes RfQ processes on MD2C platforms using probabilistic models.

problem Analyzing the negotiation process on MD2C platforms to ensure dealers' profitability.
method Probabilistic graphical models and causal inference.
result Generative models can match predictive accuracy of discriminative models while enforcing business requirements.

A novel multi-objective optimization framework improves insurance pricing fairness.

problem Exacerbated trade-offs between competing fairness criteria in insurance pricing using machine learning.
method Proposes a novel multi-objective optimization framework using NSGA-II to jointly optimize accuracy and fairness criteria.
result Consistently achieves a balanced compromise between accuracy and fairness, outperforming single-model approaches.

Paper proposes a new stock price forecasting method using DRAGAN and feature matching.

problem Capturing correlations and training instability in GANs for stock price forecasting.
method Introduces DRAGAN and feature matching for improved training stability and correlation capture.
result Proposed method outperforms LSTM and basic GANs in stock price forecasting.

Paper proposes method to calibrate market simulator for various scenarios.

problem Calibrate market simulator to represent different market conditions.
method Two-step method using GAN with self-attention to train discriminator and optimize simulator parameters.
result Demonstrates effectiveness of method in capturing various market scenarios.

Machine learning models predict housing prices using macroeconomic factors.

problem Predicting housing prices using macroeconomic data.
method Used machine learning (kNN and tree-bagging) on a dataset of macroeconomic factors.
result Machine learning models can predict housing prices with uncertainties better than existing index uncertainties.

Algorithms learned from data are increasingly used for deciding many aspects in our life: from movies we see, to prices we pay, or medicine we get. Yet there is growing evidence that decision making by inappropriately trained algorithms may unintentionally discriminate people. For example, in automated matching of cand…

2017-08-02abs ↗pdf ↗

Develops a method to estimate the shadow riskless rate from empirical data.

problem No risky asset in market, need for a shadow riskless rate.
method PCA, SVD, regularization to estimate SRR from correlated geometric Brownian motion.
result Estimates the shadow riskless rate from empirical datasets.

This study connects financial volatility to quantum mechanics on hyperbolic manifolds.

problem Deriving a geometric interpretation of financial volatility.
method Mapping financial pricing to quantum Hamiltonians via transformations.
result Financial volatility is a diffusion process on a hyperbolic manifold.

Predicting the direction of assets have been an active area of study and a difficult task. Machine learning models have been used to build robust models to model the above task. Ensemble methods is one of them showing results better than a single supervised method. In this paper, we have used generative and discriminat…

2019-02-21abs ↗pdf ↗

The study quantifies and compares aleatoric and epistemic discrimination in ML models.

problem Sources of discrimination in ML models and their impact on performance.
method Quantifying aleatoric and epistemic discrimination using statistical experiments and model accuracy.
result State-of-the-art fairness interventions are effective at removing epistemic discrimination but not aleatoric discrimination in datasets with missing values.

Discrimination-aware classification is receiving an increasing attention in data science fields. The pre-process methods for constructing a discrimination-free classifier first remove discrimination from the training data, and then learn the classifier from the cleaned data. However, they lack a theoretical guarantee f…

2017-02-28abs ↗pdf ↗

Discriminator guidance improves autoregressive diffusion models for generating molecular graphs.

problem Improving the accuracy of autoregressive diffusion models for generating molecular graphs.
method Deriving ways to use a discriminator with a pretrained generative model in the discrete case, including optimal and sub-optimal scenarios.
result Using a discriminator can correct pretrained models and improve exact sampling from the data distribution.

Kernel discriminant analysis uses nonlinear embeddings to improve classification.

problem Limited effectiveness of linear discriminant analysis in capturing nonlinear features.
method Study of nonlinear embeddings in kernel discriminant analysis using polynomial and Gaussian kernels, solving generalized eigenvalue problems.
result Polynomial and Gaussian discriminants capture class differences through population moments and randomized projections.

PBN combines generative and discriminative capabilities in a neural network.

problem Combining generative and discriminative capabilities in neural networks.
method Convolutional PBN, sharing FF-NN embodiment, combining generative and discriminative qualities.
result PBN shows excellent qualities from either generative or discriminative viewpoint.

This paper uses GAN and ERMSE to improve stock price movement prediction accuracy.

problem Predicting stock price movement direction is challenging due to complex, incomplete, and fuzzy information.
method The paper proposes a deep learning model using GAN and ERMSE to forecast stock market trends.
result The GAN model outperformed LSTM in predicting stock price movement direction with a 4.35% improvement.

Study infinite Euclidean distance discriminants of algebraic varieties.

problem Understanding the structure of data points with infinitely many critical points in Euclidean distance correspondence.
method Developed computer code to compute discriminants and proved properties of fibers.
result Infinite Euclidean distance discriminants contain all data points with infinitely many critical points for the nearest-point problem.

Generalized dual discriminator GANs improve upon traditional GANs by using two discriminators and a flexible loss function.

problem Mode collapse in GANs.
method Introducing dual discriminator αα-GANs and extending the approach to arbitrary functions.
result The approach reduces the optimization problem to a linear combination of an ff-divergence and a reverse ff-divergence.

We study two important concepts in adversarial deep learning---adversarial training and generative adversarial network (GAN). Adversarial training is the technique used to improve the robustness of discriminator by combining adversarial attacker and discriminator in the training phase. GAN is commonly used for image ge…

2018-07-27abs ↗pdf ↗

Paper proposes distributed sparse multicategory discriminant analysis for classification.

problem Sparse multicategory classification with distributed data.
method Convex formulation, distributed setting, invariant discriminant subspace recovery.
result Distributed sparse multicategory linear discriminant analysis performs as good as centralized version after a few rounds of communications.

Generative Adversarial Networks (GANs) can successfully approximate a probability distribution and produce realistic samples. However, open questions such as sufficient convergence conditions and mode collapse still persist. In this paper, we build on existing work in the area by proposing a novel framework for trainin…

2018-07-31abs ↗pdf ↗

New method computes discriminative classifiers from generative models.

problem Discriminative vs generative classifiers are often seen as distinct, but this work shows they can be equivalent.
method General theoretical result showing generative classifiers can be computed discriminatively.
result Bayesian Maximum Posterior classifier from generative models matches discriminative classifier definition.

A measure called relative cluster entropy distinguishes between correlated and uncorrelated sequences.

problem Distinguishing between sequences with different correlation degrees.
method Minimum relative entropy principle applied to cluster partitions of power-law correlated sequences.
result Optimal Hurst exponents are selected for market price series, indicating non-markovianity.