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.
The paper sorts big data by revealed preferences, improving consumer and policy decisions.
In this paper we propose a Bayesian nonparametric model for clustering partial ranking data. We start by developing a Bayesian nonparametric extension of the popular Plackett-Luce choice model that can handle an infinite number of choice items. Our framework is based on the theory of random atomic measures, with the pr…
Proposes causal modeling for intersectional fairness in rankings.
Differential Calculus is a staple of the college mathematics major's diet. Eventually one becomes tired of the same routine, and wishes for a more diverse meal. The college math major may seek to generalize applications of the derivative that involve functions of more than one variable, and thus enjoy a course on Multi…
The paper critiques ε-fairness, showing it can lead to unfair outcomes and proposes a utility-based approach.
Predicts academic risk in college students using interpretable machine learning.
Modeling student behaviors and multiple predictions for early intervention.
Study shows GDP and CPI predict CCC funding, highlighting need for economic forecasting.
Databases are widespread, yet extracting relevant data can be difficult. Without substantial domain knowledge, multivariate search queries often return sparse or uninformative results. This paper introduces an approach for searching structured data based on probabilistic programming and nonparametric Bayes. Users speci…
The study uses Hidden Markov Models to analyze student enrollment patterns and academic performance.
1. Translated by Thomas E. Cecil, Department of Mathematics and Computer Science, College of the Holy Cross, Worcester, MA 01610, USA; E-mail address: cecil@mathcs.holycross.edu 2. Typed by Wenjiao Yan, School of Mathematical Sciences, Laboratory of Mathematics and Complex Systems, Beijing Normal University, Beijing 10…
Study shows human advisors use context to improve student outcomes in algorithm-assisted advising.
A framework predicts employment status for students considering unconscious biases.
ELCO enhances graph generation by adding new nodes and edges.
This paper determines the minimal degree sequence for two compact rational knots, namely the trefoil and figure-eight knots. We find explicit projections with the minimal degree sequence of each knot. This is done by modifying a non-compact rational minimal-degree parameterization of the trefoil and figure-eight knots …
We present a new approach for mitigating unfairness in learned classifiers. In particular, we focus on binary classification tasks over individuals from two populations, where, as our criterion for fairness, we wish to achieve similar false positive rates in both populations, and similar false negative rates in both po…
Study predicts academic achievement using students' support networks.
Study shows how online personalization can lead to unfair models due to biased user responses.
Machine learning methods tend to outperform traditional statistical models at prediction. In the prediction of academic achievement, ML models have not shown substantial improvement over logistic regression. So far, these results have almost entirely focused on college achievement, due to the availability of administra…
The paper shows how demographic data can lead to biased predictions, proposing 'Affirmative Information' as a solution.
Advances in mobile computing technologies have made it possible to monitor and apply data-driven interventions across complex systems in real time. Markov decision processes (MDPs) are the primary model for sequential decision problems with a large or indefinite time horizon. Choosing a representation of the underlying…
Develops NFCF to reduce gender bias in social media recommendation systems.
Stratifying patients at risk for postoperative complications may facilitate timely and accurate workups and reduce the burden of adverse events on patients and the health system. Currently, a widely-used surgical risk calculator created by the American College of Surgeons, NSQIP, uses 21 preoperative covariates to asse…
This paper develops a learning framework for optimal strategies in multi-stage decentralized matching markets.
sktime is an open source, Python based, sklearn compatible toolkit for time series analysis developed by researchers at the University of East Anglia (UEA), University College London and the Alan Turing Institute. A key initial goal for sktime was to provide time series classification functionality equivalent to that a…
We augment linear Support Vector Machine (SVM) classifiers by adding three important features: (i) we introduce a regularization constraint to induce a sparse classifier; (ii) we devise a method that partitions the positive class into clusters and selects a sparse SVM classifier for each cluster; and (iii) we develop a…
We propose a fair principal component analysis method that balances reconstruction error and subgroup fairness.
Introduces privilege scores to measure and interpret protected attribute-related privilege in machine learning models.
We propose a unified data-driven framework based on inverse optimal transport that can learn adaptive, nonlinear interaction cost function from noisy and incomplete empirical matching matrix and predict new matching in various matching contexts. We emphasize that the discrete optimal transport plays the role of a varia…
Study shows financial literacy, social capital, and financial tech positively impact financial inclusion of Indonesian students.
In his lectures at College de France, P.L. Lions introduced the concept of Master equation, see [5] for Mean Field Games. It is introduced in a heuristic fashion, from the system of partial differential equations, associated to a Nash equilibrium for a large, but finite, number of players. The method, also explained in…
A test detects unfairness in machine learning classifiers.
Meta-ANOVA simplifies complex models for better interpretability.
The paper explores fairness in AI algorithms across various sectors.
Individuals do not respond uniformly to treatments, events, or interventions. Sociologists routinely partition samples into subgroups to explore how the effects of treatments vary by covariates like race, gender, and socioeconomic status. In so doing, analysts determine the key subpopulations based on theoretical prior…
Hawksmoor's ceiling and Pantheon dome cofferings are explained using conformal mappings and Mercator's projection.
In this paper, we propose a robust method to estimate the average treatment effects in observational studies when the number of potential confounders is possibly much greater than the sample size. We first use a class of penalized M-estimators for the propensity score and outcome models. We then calibrate the initial e…
Intersectional constraints improve selection outcomes by reducing inequality.
Increasingly, discrimination by algorithms is perceived as a societal and legal problem. As a response, a number of criteria for implementing algorithmic fairness in machine learning have been developed in the literature. This paper proposes the Continuous Fairness Algorithm (CFA) which enables a continuous interpol…
Predictive modeling is increasingly being employed to assist human decision-makers. One purported advantage of replacing human judgment with computer models in high stakes settings-- such as sentencing, hiring, policing, college admissions, and parole decisions-- is the perceived "neutrality" of computers. It is argued…
We introduce the study of fairness in multi-armed bandit problems. Our fairness definition can be interpreted as demanding that given a pool of applicants (say, for college admission or mortgages), a worse applicant is never favored over a better one, despite a learning algorithm's uncertainty over the true payoffs. We…
This paper protects rankings from differential privacy breaches.
The paper addresses privacy in rank aggregation using randomized responses.
This paper addresses the problem of rank aggregation, which aims to find a consensus ranking among multiple ranking inputs. Traditional rank aggregation methods are deterministic, and can be categorized into explicit and implicit methods depending on whether rank information is explicitly or implicitly utilized. Surpri…
We study the problem of rank aggregation: given a set of ranked lists, we want to form a consensus ranking. Furthermore, we consider the case of extreme lists: i.e., only the rank of the best or worst elements are known. We impute missing ranks by the average value and generalise Spearman's ρto extreme ranks. Our main …
Develops a method to infer partial rankings from sparse comparisons.
Research characterizes learnability of multilabel ranking problems.
This paper compares rank aggregation methods for partial label ranking.