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

3671107142 · Jun 202019922001200920172026
48 results for individual rights

We study agents communicating over an underlying network by exchanging messages, in order to optimize their individual regret in a common nonstochastic multi-armed bandit problem. We derive regret minimization algorithms that guarantee for each agent vv an individual expected regret of $\widetilde{O}\left(\sqrt{\left(…

2019-07-07abs ↗pdf ↗

Efficient sequential matching of supply and demand is a problem of interest in many online to offline services. For instance, Uber, Lyft, Grab for matching taxis to customers; Ubereats, Deliveroo, FoodPanda etc for matching restaurants to customers. In these online to offline service problems, individuals who are respo…

2018-03-27abs ↗pdf ↗

New framework for contesting algorithmic decisions, not just explaining them.

problem Helping individuals review and correct erroneous algorithmic decisions.
method Operationalized contestability as a natural complement to explainable AI (XAI), identifying three types of evidence for reversal.
result Existing EU legislation already grants individuals legal rights to contest algorithmic decisions.

Proposes a compensation mechanism for improving individual forecast confidence.

problem Difficult to assess the quality of individual probabilistic forecasts and their utilities.
method Compensation mechanism based on fair bets and online learning.
result The proposed mechanism cannot be exploited and ensures forecasted utility matches actual utility.

The paper develops deep learning models for personalized treatment rules in survival analysis.

problem Deriving optimal treatment rules for bivariate survival outcomes in randomized trials.
method Adaptive prediction-powered learning using deep neural networks and stochastic policies.
result Maximizes joint survival probability beyond fixed time points (t1,t2)(t_1, t_2).

A pair (α,β)(α, β) of simple closed geodesics on a closed and oriented hyperbolic surface MgM_g of genus gg is called a filling pair if the complementary components of αβα\cupβ in MgM_g are simply connected. The length of a filling pair is defined to be the sum of their individual lengths. In \cite{Aou}, Aougab-Huang con…

2019-07-16abs ↗pdf ↗

Intense recent discussions have focused on how to provide individuals with control over when their data can and cannot be used --- the EU's Right To Be Forgotten regulation is an example of this effort. In this paper we initiate a framework studying what to do when it is no longer permissible to deploy models derivativ…

2019-07-11abs ↗pdf ↗

New method estimates optimal personalized treatment rules from mixed data sources.

problem Combining RCT and observational data for personalized treatment rules.
method Doubly robust estimator for value function, maximizing within pre-specified ITR class.
result Consistent and asymptotically normal optimal value estimator with N1/3N^{-1/3} rate of convergence.

Paper proposes a new metric to evaluate survival models, especially for censored data.

problem Challenges in evaluating survival prediction models due to censored data.
method Developed a novel approach to estimate Mean Absolute Error (MAE) for survival datasets with censored data.
result The proposed MAE metric using pseudo-observations accurately ranks model performance and closely matches true MAE.

We consider settings in which the right notion of fairness is not captured by simple mathematical definitions (such as equality of error rates across groups), but might be more complex and nuanced and thus require elicitation from individual or collective stakeholders. We introduce a framework in which pairs of individ…

2019-05-25abs ↗pdf ↗

New method achieves nearly horizon-free offline reinforcement learning for tabular and linear MDPs.

problem Achieving efficient reinforcement learning without knowing the horizon.
method Simple recursion-based method to bound total variance in offline scenarios.
result Nearly horizon-free sample complexity bounds for offline policy evaluation and optimization.

Enhances survival analysis by separating population behavior from individual dynamics.

problem Improving the training and inference of survival analysis models for sparsely occurring events.
method Decouples survival analysis into an aggregated baseline hazard and independent survival scores.
result Achieves competitive performance and robust results without fine-tuning.

Bayesian inference forgetting framework removes influence of single data points.

problem Enforcement of the right to be forgotten in machine learning causes high costs for companies.
method Develops forgetting algorithms for variational and Markov chain Monte Carlo in Bayesian inference.
result Proves removal of influence of single datums on learned models with guaranteed generalizability.

Causal forests use honesty to reduce overfitting, but it can also reduce accuracy, especially with large datasets.

problem Causal forests' honesty can reduce accuracy of individual treatment effects.
method Using honest estimation to divide data into two samples, one for subgroup definition and another for effect estimation.
result Honest estimation can reduce accuracy by requiring 27% more data to match performance of non-honest models.

Linear ODEs are solved by geodesics in hyperbolic geometry.

problem Solving real linear second order ODEs.
method Defined a Riemannian hyperbolic geometry and showed that solutions to ODEs correspond to geodesics in this geometry.
result Local solutions to ODEs correspond to geodesics in a specific hyperbolic geometry.

Local surrogate models, to approximate the local decision boundary of a black-box classifier, constitute one approach to generate explanations for the rationale behind an individual prediction made by the back-box. This paper highlights the importance of defining the right locality, the neighborhood on which a local su…

2018-06-19abs ↗pdf ↗

Efficient oblique RSF method improves prediction and interpretability.

problem Limited computational efficiency and difficulty in interpreting oblique RSF ensembles.
method Newton-Raphson scoring for computational efficiency and negation importance for variable importance estimation.
result The method reduces computational overhead by 450 times and improves prediction accuracy.

The Internet is known to have had a powerful impact on on-line retailer strategies in markets characterised by long-tail distribution of sales. Such retailers can exploit the long tail of the market, since they are effectively without physical limit on the number of choices on offer. Here we examine two extensions of t…

2008-08-12abs ↗pdf ↗

We study the performance of stochastic gradient descent (SGD) on smooth and strongly-convex finite-sum optimization problems. In contrast to the majority of existing theoretical works, which assume that individual functions are sampled with replacement, we focus here on popular but poorly-understood heuristics, which i…

2019-07-31abs ↗pdf ↗

The paper revisits the σkσ_k-Yamabe problem and proves the existence of a conformal metric with constant σ2σ_2-scalar curvature.

problem Finding a conformal metric with constant σkσ_k-scalar curvature on closed manifolds.
method Analyzing the σ2σ_2-Yamabe constant and proving its achievability under certain conditions.
result The σ2σ_2-Yamabe constant is achieved by a conformal metric, solving the σ2σ_2-Yamabe problem on manifolds with positive Yamabe constant.

The paper proves foliations of solutions to the minimal surface equation in exterior domains.

problem Existence and properties of foliations by solutions to the exterior Dirichlet problem for minimal surfaces.
method Analyzes a 1-parameter family of solutions to the minimal surface equation in exterior domains with specific boundary conditions.
result Foliation of the open subset in R^(n+1) by graphs of solutions, with bounds and asymptotic behavior.

The paper examines differentiability of horizons along their generators in Lorentz manifolds.

problem Analyzing the differentiability of horizons along their generators in Lorentz manifolds.
method Using a result that every mathematical horizon locally coincides with a Cauchy horizon, the paper proves conditions for differentiability of horizons.
result Horizons are either continuously differentiable or have differentiability jumping points.

New study finds targeting based on treatment effects outperforms risk-based targeting in social interventions.

problem Lack of accurate treatment effect estimates for machine learning-based targeting in social domains.
method Empirical assessment of targeting strategies using data from 5 real-world RCTs in various domains.
result Treatment effect-based targeting outperforms risk-based targeting, even with biased estimates.

Study bounds financial path expectations using martingale distributions.

problem Bounding path-dependent financial expectations over martingale distributions.
method Relaxed martingale optimal transport problem, approximated via linear programming.
result Empirical relaxation can be approximated within O(n^(-1/2)) error.

Study benchmarks 19 survival models on 34 datasets, finding Cox model still best.

problem Quantitative comparison of survival models on low-dimensional data.
method Comprehensive benchmarking of 19 models on 34 datasets, tuning and evaluating using 6 metrics.
result Cox Proportional Hazards model remains best overall for low-dimensional, right-censored data.

A new matrix concentration inequality for random products of matrices.

problem Understanding the behavior of random matrix products under bounded independent positive semidefinite matrices.
method Developed a non-asymptotic concentration inequality for the product of matrices.
result The inequality provides a bound on the deviation of the matrix product from its expected value.

Our paper improves uplift model evaluation on randomized controlled trials (RCT) data.

problem Variance in uplift evaluation metrics makes their signals arbitrary and unreliable.
method Theoretical analysis and statistical adjustment of the outcome to reduce variance.
result Variance reduction methods improve uplift evaluation metrics on RCT data.

For a Lie group GG and a vector bundle EE we study those actions of the Lie group TGTG on EE for which the action map TG×EETG\times E \to E is a morphism of vector bundles, and call those \emph{affine actions}. We prove that the category VectTGaff(X)\mathrm{Vect}_{TG}^{\mathrm{aff}}\left(X\right) of such actions over a fixed GG

2017-10-12abs ↗pdf ↗

Deep neural networks classify T2D from retinal images with high accuracy.

problem Detecting early-stage Type 2 Diabetes from retinal images.
method Employed deep neural networks and multi-target learning to differentiate T2D from healthy individuals.
result Classification performance improved to AUC = 0.758 [±\pm0.003] using images from both eyes.

New insights show Medicaid impacts on ED use vary widely, with some groups seeing significant increases.

problem Understanding the varied impacts of Medicaid on emergency department use.
method Causal machine learning methods to identify heterogeneous impacts.
result Meaningful heterogeneity in the effect of Medicaid on ED use, with a small group driving the overall effect.

Surveying connections between graph combinatorics and algebraic right-angled Artin groups.

problem Understanding the relationship between graph structures and algebraic properties of right-angled Artin groups.
method Analyzing the defining and extension graphs of right-angled Artin groups.
result Discovers connections to geometric group theory and complexity theory.

We introduce a notion of "quasi-right-veering" for closed braids, which plays an analogous role to "right-veering" for open books. We show that a transverse link KK in a contact 3-manifold (M,ξ)(M,ξ) is non-loose if and only if every braid representative of KK with respect to every open book decomposition that supports …

2016-01-26abs ↗pdf ↗

The study characterizes spacetime and modified gravity models using projective curvature tensor.

problem Characterizing spacetime and modified gravity models with projective curvature tensor.
method Analyzing $f\left(R,G ight)$, $f\left(R,T ight)$, and $f\left(R,L_{m} ight)$-gravity models.
result Projectively flat perfect fluid spacetimes represent dark energy era and are locally isometric to Minkowski or de-Sitter spacetimes.

In this paper we study the right-angled Coxeter groups that acts geometrically on the Salvetti complex of a certain right-angled Artin group, which we refer to as Croke-Kleiner spaces. We prove that any right-angled Coxeter group that acts geometrically on the Croke-Kleiner spaces acts with π/2π/2 angles between reflect…

2019-10-29abs ↗pdf ↗