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

146293439585 · Jun 202019922001200920172026
48 results for equal experience

AI-driven tax policies improve economic equality and productivity.

problem Lack of appropriate economic data and limited opportunity to experiment.
method Two-level deep reinforcement learning approach to learn dynamic tax policies from observational data.
result AI-driven tax policies improve the trade-off between equality and productivity by 16%.

SCS identifies a range of plausible equally weighted portfolios, quantifying selection uncertainty.

problem Uncertainty in selecting the best equally weighted portfolio subset.
method Introduces Selection Confidence Set (SCS) for EWPs, covering plausible portfolios with high probability.
result SCS quantifies selection uncertainty and covers the unknown optimal selection with high probability.

We present pairwise fairness metrics for ranking models and regression models that form analogues of statistical fairness notions such as equal opportunity, equal accuracy, and statistical parity. Our pairwise formulation supports both discrete protected groups, and continuous protected attributes. We show that the res…

2019-06-12abs ↗pdf ↗

Conformal prediction sets can lead to unfair outcomes.

problem Disparate impact in decision-making with conformal prediction sets.
method Experiments with human participants to demonstrate disparate impact and propose equalizing set sizes across groups.
result Providing prediction sets that satisfy Equalized Coverage increases disparate impact compared to marginal coverage.

This paper improves financial derivative pricing by incorporating multiple hedging instruments.

problem Valuation of financial derivatives with multiple hedging instruments.
method Deep hedging algorithm and reinforcement learning to solve global hedging problems.
result Including options as hedging instruments can significantly decrease equal risk prices and market incompleteness.

A new algorithm solves constrained optimization problems with stochastic gradients.

problem Nonlinear equality constrained optimization with rank-deficient Jacobians.
method Step decomposition strategy combining normal and tangential steps.
result Convergence guarantees in rank-deficient Jacobian cases.

OLLA framework efficiently samples from constrained distributions with nonconvex constraints.

problem Sampling from constrained distributions with nonconvex constraints is challenging.
method Overdamped Langevin with Landing (OLLA) framework that handles both equality and inequality constraints.
result OLLA converges exponentially fast to the constrained target density in W2W_2 distance.

New measures generalize existing ones, linking information and risk.

problem Linking information measures and risk in statistical decision problems.
method Introducing new families of divergence measures and deriving an information processing equality.
result Extension of variational φφ-divergence representation to multiple distributions.

New method uses causal thinking to make AI fairer decisions.

problem Designing fair machine learning models that treat equal individuals equally and unequals unequally.
method Rank-preserving interventional distributions and warping method.
result Warping method effectively identifies discriminated individuals and mitigates unfairness.

An algorithm solves optimization problems with large sample sets, improving worst-case complexity.

problem Continuous nonlinear-equality-constrained optimization problems with large numbers of terms.
method Progressively sampled finite sets to solve related problems with growing sample sizes.
result Better worst-case sample complexity compared to solving with full sets of samples.

TAET tackles long-tailed distributions in adversarial robustness.

problem Long-tailed distributions complicate adversarial robustness in real-world applications.
method TAET integrates an initial stabilization phase followed by a stratified equalization adversarial training phase.
result TAET achieves significant improvements in robustness and efficiency.

This paper proposes an incremental solution to Fast Subclass Discriminant Analysis (fastSDA). We present an exact and an approximate linear solution, along with an approximate kernelized variant. Extensive experiments on eight image datasets with different incremental batch sizes show the superiority of the proposed ap…

2020-02-11abs ↗pdf ↗

Optimization algorithms affect fairness in deep learning models, especially with adaptive methods like RMSProp.

problem The impact of optimization algorithms on fairness in deep learning models, particularly under imbalance.
method Stochastic differential equation analysis of optimization dynamics in an analytically tractable setup.
result RMSProp, an adaptive optimizer, converges to fairer minima than SGD under severe imbalance.

When learning a new concept, not all training examples may prove equally useful for training: some may have higher or lower training value than others. The goal of this paper is to bring to the attention of the vision community the following considerations: (1) some examples are better than others for training detector…

2013-11-25abs ↗pdf ↗

This paper tackles fair Bayes-optimal classifiers under predictive parity, proving their limitations and proposing a new algorithm.

problem Ensuring fair Bayes-optimal classifiers under predictive parity, especially when group performance levels vary widely.
method Proving the limitations of fair Bayes-optimal classifiers under predictive parity and proposing a new adaptive thresholding algorithm, FairBayes-DPP.
result Fair Bayes-optimal classifiers under predictive parity may not hold if group performance levels vary widely, leading to within-group unfairness.

The Willmore flow is well known problem from the differential geometry. It minimizes the Willmore functional defined as integral of the mean-curvature square over given manifold. For the graph formulation, we derive modification of the Willmore flow with anisotropic mean curvature. We define the weak solution and we pr…

2011-11-13abs ↗pdf ↗

The average and median income dependence on work experience and time is analyzed and modeled for the USA. The original data set providing the mean and median income estimates in 10 year long intervals spans a long time period of almost 35 years ? from 1967 to 2003. A microeconomic model linking personal income, populat…

2008-11-04abs ↗pdf ↗

New method uses non-translation invariant risk measures for fair financial derivative pricing.

problem Inequalities in financial derivative pricing under traditional risk measures.
method Deep reinforcement learning with modified deep hedging algorithm.
result Effective pricing of financial derivatives without price inflation.

Deep RL solves dynamic risk pricing for complex financial models.

problem Dynamic risk measures in financial derivatives pricing.
method Deterministic actor-critic deep reinforcement learning (ACRL) for time-consistent expectile risk.
result High-quality hedging policies and prices for complex financial instruments.

We show that for neural network functions that have width less or equal to the input dimension all connected components of decision regions are unbounded. The result holds for continuous and strictly monotonic activation functions as well as for the ReLU activation function. This complements recent results on approxima…

2018-07-03abs ↗pdf ↗

FairNN learns fair representations and decisions by optimizing a multi-objective loss function.

problem Fairness in machine learning models for decision-making.
method Joint feature representation and classification with multi-objective loss function.
result Joint approach outperforms separate treatment of fairness in representation learning or supervised learning.

We started from computer experiments with simple one-dimensional ergodic dynamical systems called interval exchange transformations. Correlators in these systems decay as a power of time. In the simplest non-trivial case the exponent is equal to 1/3. We found a formula connecting characteristic exponents with explicit …

1997-01-28abs ↗pdf ↗

The paper explores knots with equal bridge and braid index, conjecturing they have a unique equilibrium state.

problem Identifying and characterizing knots with equal bridge and braid index.
method Heuristic explanation and numerical exploration of conjectured properties.
result Identification of BB knots in various knot families and an exponential growth in the number of BB knots with increasing crossing number.

Partial label learning (PLL) aims to solve the problem where each training instance is associated with a set of candidate labels, one of which is the correct label. Most PLL algorithms try to disambiguate the candidate label set, by either simply treating each candidate label equally or iteratively identifying the true…

2018-04-20abs ↗pdf ↗

Solves equality case in isoperimetric inequality for non-convex domains.

problem Equality case in relative isoperimetric inequality outside convex sets.
method Analyzes non-convex domains to settle the equality case.
result Solves the equality case for relative isoperimetric inequality outside arbitrary convex sets.

Develops spherical density-equalizing maps for closed surfaces.

problem Lack of methods for genus-0 closed surfaces.
method Conformal parameterization onto unit sphere, density equalization, quasi-conformal theory, harmonic energy, landmark constraints.
result Landmark-aligned spherical density-equalizing maps balancing different distortion measures.

Traditionally, psychophysical experiments are conducted by repeated measurements on a few well-trained participants under well-controlled conditions, often resulting in, if done properly, high quality data. In recent years, however, crowdsourcing platforms are becoming increasingly popular means of data collection, mea…

2019-05-17abs ↗pdf ↗

It seems to be a pearl of conventional wisdom that parameter learning in deep sum-product networks is surprisingly fast compared to shallow mixture models. This paper examines the effects of overparameterization in sum-product networks on the speed of parameter optimisation. Using theoretical analysis and empirical exp…

2019-05-20abs ↗pdf ↗

New partition designs reduce star discrepancy in high-dimensional sampling.

problem Improving the expected star discrepancy in high-dimensional sampling.
method Developed non-equal volume partitions to achieve lower expected star discrepancy.
result Explicit upper bounds for expected star discrepancy under non-equal volume partitions.

Square loss performs comparably or better than cross-entropy in neural architectures for various tasks.

problem The superiority of cross-entropy loss over square loss in classification tasks is debated.
method Comparison of several neural architectures on NLP, ASR, and computer vision datasets using both loss functions.
result Square loss often produces better results in the majority of tasks, especially in NLP and ASR.

In this paper, we present a reverberation removal approach for speaker verification, utilizing dual-label deep neural networks (DNNs). The networks perform feature mapping between the spectral features of reverberant and clean speech. Long short term memory recurrent neural networks (LSTMs) are trained to map corrupted…

2018-09-08abs ↗pdf ↗