Achieving Fairness and Accuracy in Regressive Property Taxation

Ozan Candogan; Feiyu Han; Haihao Lu

Home/Archive/arXiv

arXiv · 2312.05996

Achieving Fairness and Accuracy in Regressive Property Taxation

Ozan Candogan·Feiyu Han·Haihao Lu

View original source ↗Read source document ↗Export metadata ↓

Abstract

Regressivity in property taxation, or the disproportionate overassessment of lower-valued properties compared to higher-valued ones, results in an unfair taxation burden for Americans living in poverty. To address regressivity and enhance both the accuracy and fairness of property assessments, we introduce a scalable property valuation model called the $K$-segment model. Our study formulates a mathematical framework for the $K$-segment model, which divides a single model into $K$ segments and employs submodels for each segment. Smoothing methods are incorporated to balance and smooth the multiple submodels within the overall model. To assess the fairness of our proposed model, we introduce two innovative fairness measures for property evaluation and taxation, focusing on group-level fairness and extreme sales price portions where unfairness typically arises. Compared to the model employed currently in practice, our study demonstrates that the $K$-segment model effectively improves fairness based on the proposed measures. Furthermore, we investigate the accuracy--fairness trade-off in property assessments and illustrate how the $K$-segment model balances high accuracy with fairness for all properties. Our work uncovers the practical impacts of the $K$-segment models in addressing regressivity in property taxation, offering a tangible solution for policymakers and property owners. By implementing this model, we pave the way for a fairer taxation system, ensuring a more equitable distribution of tax burdens.

Explore related subjects

math.OC

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Ozan Candogan, Feiyu Han, Haihao Lu. 2023-12-10. Achieving Fairness and Accuracy in Regressive Property Taxation. https://arxiv.org/abs/2312.05996

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

AdGT: Decentralized Gradient Tracking with Adaptive Per-Agent Stepsizes

In decentralized optimization, gradient-tracking methods typically rely on a single global stepsize. This choice can be conservative when agents have local objectives with different smoothness constants, since the stepsize must remain stable for the agent with the largest smoothness constant. This paper proposes AdGT, a decentralized gradient-tracking method in which each agent adapts its own stepsize using local gradient variation and a single global safety factor. The method reduces fixed-stepsize tuning effort and allows agents to exploit local smoothness information during the iterations. For smooth and strongly convex local objectives over undirected networks, we prove that the analyzed AdGT update converges linearly to the exact consensus optimizer. We also study two adaptive stepsize updates that use changes in the gradient-tracking direction. We characterize when the corresponding candidate determines the stepsize and prove conditional lower and upper stepsize bounds and linear convergence under an additional relative tracking-disagreement condition. Experiments on logistic regression, ridge regression, synthetic quadratic problems, and a linear-regression benchmark against state-of-the-art decentralized solvers show that AdGT often reaches a given accuracy in fewer iterations or gradient evaluations than tuned fixed-stepsize GT and the tested baselines, especially under heterogeneous local smoothness. In the topology experiments, each tested AdGT update uses one common safety factor across all graphs, whereas the fixed GT stepsize is tuned separately for each graph and seed.

math.OC↗

arXiv2026

Brockett cost function for symplectic eigenvalues

The sum of symplectic eigenvalues and corresponding eigenvectors of symmetric positive-definite matrices in the sense of Williamson's theorem can be computed via minimization of a trace cost function under the symplecticity constraint. Optimal solutions to this problem only offer a symplectic basis for the symplectic eigenspace corresponding to the sought symplectic eigenvalues. In this note, we introduce a Brockett cost function and investigate its properties and the connection with the symplectic eigenvalues and eigenvectors of the considered matrix. Specifically, we prove that any stationary point consists of symplectic eigenvectors, characterize the saddle points and global minimizers based on which the trace minimization theorem for the symplectic eigenvalues is re-established, and the nonexistence of local nonglobal minimizers is justified.

math.OC↗

arXiv2026

Riemannian Bilevel Optimization with Gradient Aggregation

We study bilevel optimization on Riemannian manifolds when the lower-level solution set is a positive-dimensional submanifold, so that implicit differentiation fails. We propose Riemannian Bilevel Descent Aggregation (RBDA), which extends bilevel descent aggregation to manifolds. Its inner loop aggregates the lower-level descent direction with the upper-level gradient under a decaying multiplier, and its hypergradient is the reverse-mode derivative of the unrolled loop. Under geodesic convexity and quadratic growth of the lower level, the inner iterates converge to a point of the optimistic solution set at a polynomial rate. Approximate minimizers of the objective with a finite number of inner iterations converge to minimizers of the optimistic value. In the experiments RBDA selects the optimistic solution where the implicit and unrolled estimators remain at the initial point or stop at a larger query loss. While each of its outer steps costs more than that of the unrolled estimator, it attains the highest test accuracy in data hyper-cleaning.

math.OC↗