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

Trend · papers per month

3527041,0561,408 · Jun 202019922001200920172026
48 results for Pareto Model

This paper solves aggregation of Pareto optimal models by using Bayesian priors and weighted averaging.

problem How to rationally aggregate Pareto optimal models while preserving Pareto efficiency.
method Four logical steps: 1) Bayesian models, 2) Prior as preference ranking, 3) Consistent aggregation, 4) Weighted average of priors.
result All rational/consistent aggregation rules follow a generalized hierarchical Bayesian model.

Paper proposes Adaptive Pareto Exploration for identifying Pareto optimal arms in multi-objective scenarios.

problem Identifying Pareto optimal arms in multi-objective scenarios with relaxed constraints.
method Adaptive Pareto Exploration strategy for different relaxations of Pareto Set Identification.
result Reduction in sample complexity when identifying at most k Pareto optimal arms.

This paper develops a method to approximate the whole Pareto set for expensive multi-objective optimization.

problem Finding an approximate Pareto front with limited expensive evaluations.
method A novel learning-based method to approximate the whole Pareto set for multi-objective Bayesian optimization (MOBO).
result The method approximates the whole Pareto set, not just a finite set, for MOBO.

The paper tackles the trade-off between fairness and accuracy in machine learning models.

problem Ensuring fairness in machine learning often reduces model accuracy.
method The paper introduces formal tools for reconciling the fairness-accuracy tension using Pareto optimality from multi-objective optimization.
result The Chebyshev scalarization scheme is superior for finding Pareto optimal solutions compared to the linear scalarization scheme.

This work improves cost-aware Bayesian optimization by introducing Pareto-efficient acquisition functions.

problem Cost variability in hyperparameter evaluations affects the efficiency of Bayesian optimization.
method Reformulated cost-aware Bayesian optimization as Pareto efficiency, proposing a novel Pareto-efficient expected improvement.
result Pareto-efficient acquisition functions significantly outperform previous solutions, providing finer control over cost-accuracy trade-offs.

Proposes Pareto efficient fairness for supervised learning models.

problem Ensuring fairness in machine learning models without sacrificing accuracy.
method Formulates a bilevel optimization problem to find Pareto efficient classifiers.
result Guaranteed solution on Pareto frontier for convex and non-convex objectives.

The paper proposes a new method to learn choice functions using Pareto-embeddings.

problem Learning subset choices from feature vectors.
method Embedding choice alternatives into a higher-dimensional utility space and identifying choice sets with Pareto-optimal points. Minimizing a differentiable loss function.
result The feasibility of learning a Pareto-embedding demonstrated on benchmark datasets.

Study on Pareto optimality in multi-objective bandit problems.

problem Pareto optimality in multi-objective multi-armed bandit problems.
method Formulated adversarial multi-objective multi-armed bandit, defined Pareto regrets, presented algorithms, established upper and lower bounds.
result New algorithms are optimal in adversarial settings and nearly optimal in stochastic settings.

New algorithms identify Pareto optimal sets in multi-objective bandit problems.

problem Identifying Pareto optimal sets in multi-objective bandit problems.
method Empirical Gap Elimination (EGE) algorithms combining hardness estimation and elimination schemes.
result Two EGE algorithms have exponentially decaying error probabilities with budget.

PALS extends PAL for optimizing stochastic simulators efficiently.

problem Optimizing stochastic simulators with high output variance and expensive evaluations.
method Bayesian optimization with probabilistic models, extending PAL for stochastic settings.
result PALS outperforms other methods in optimizing stochastic simulators.

SVH-PSL uses Stein Variational Gradient Descent and Hypernetworks to improve Pareto set learning for expensive MOO.

problem Fragmented surrogate models and pseudo-local optima in expensive multi-objective optimization problems.
method SVH-PSL integrates Stein Variational Gradient Descent (SVGD) with Hypernetworks to address fragmentation and pseudo-local optima.
result SVH-PSL significantly improves the quality of the learned Pareto set, offering a promising solution for expensive MOO.

New method generates continuous Pareto sets for multi-task learning.

problem Challenges in finding optimal solutions for correlated multi-task learning problems.
method Efficiently generates locally continuous Pareto sets and fronts in multi-objective optimization problems.
result Demonstrates continuous analysis of Pareto optimal solutions in machine learning problems.

Paper proves Pareto efficient insurance for multiple entities.

problem Optimizing insurance for multiple policyholders and insurers.
method Sum-minimization characterization and pairwise implementability analysis.
result Characterization of Pareto efficient insurance arrangements.

We identify and optimize the fairness-accuracy tradeoff through TAF Curves and FAUC metrics.

problem Balancing fairness and accuracy in machine learning models for high-stakes decisions.
method Developed TAF Curves and FAUC metric to quantify the tradeoff, and introduced FairStacks framework to expand the Pareto frontier.
result FairStacks framework expands the empirical Pareto frontier and improves the FAUC for model ensembles.

A new method for diverse Pareto solutions in multi-objective learning.

problem Maximizing diversity while maximizing hypervolume in Pareto solutions.
method Annealed Stein Variational Gradient Descent (SVGD) with diverse gradient directions.
result SVH-MOL achieves superior performance in multi-objective and multi-task learning.

Multi-task learning is a powerful method for solving multiple correlated tasks simultaneously. However, it is often impossible to find one single solution to optimize all the tasks, since different tasks might conflict with each other. Recently, a novel method is proposed to find one single Pareto optimal solution with…

2019-12-30abs ↗pdf ↗

Employing profits data of Japanese companies in 2002 and 2003, we confirm that Pareto's law and the Pareto index are derived from the law of detailed balance and Gibrat's law. The last two laws are observed beyond the region where Pareto's law holds. By classifying companies into job categories, we find that companies …

2005-06-08abs ↗pdf ↗

We prove that Pareto theory of circulation of elites results from our wealth evolution model, Kelly criterion for optimal betting and Keynes' observation of "animal spirits" that drive the economy and cause that human financial decisions are prone to excess risk-taking.

2014-12-15abs ↗pdf ↗

A multiobjective optimization problem is simplicial if the Pareto set and front are homeomorphic to a simplex and, under the homeomorphisms, each face of the simplex corresponds to the Pareto set and front of a subproblem. In this paper, we show that strongly convex problems are simplicial under a mild assumption on th…

2019-04-07abs ↗pdf ↗

New ABC method improves Bézier simplex fitting for noisy data.

problem Overfitting in Bézier simplex fitting when sample points are not on the Pareto set.
method Extended Bézier simplex model to a probabilistic one and proposed a new learning algorithm based on approximate Bayesian computation (ABC) with Wasserstein distance.
result The new algorithm converges on a finite sample and outperforms deterministic methods on noisy instances.

A new method for multi-objective Bayesian optimization using entropy search and variational lower bound maximization.

problem Efficiently optimizing multiple objectives in continuous domains.
method Approximates the Pareto-frontier using a mixture distribution and optimizes the balance through variational lower bound maximization.
result Demonstrated effectiveness especially with many objective functions.

This study considers a model of the income distribution of agents whose pairwise interaction is asymmetric and price-invariant. Asymmetric transactions are typical for chain-trading groups who arrange their business such that commodities move from senior to junior partners and money moves in the opposite direction. The…

2006-05-17abs ↗pdf ↗

This work fills the gap in understanding multi-objective learning generalization.

problem Lack of statistical learning theory insights into multi-objective learning generalization.
method Established generalization bounds and excess bounds for multi-objective learning.
result Showed that all Pareto-optimal solutions can be approximated by empirically Pareto-optimal ones, but not vice versa.

MOL-TS uses Thompson Sampling for multi-objective linear bandits with Pareto guarantees.

problem Optimizing multiple conflicting objectives in linear contextual bandits.
method Proposes MOL-TS, a Thompson Sampling algorithm with Pareto regret guarantees.
result Achieves a worst-case Pareto regret bound of O~(d3/2T)\widetilde{O}(d^{3/2}\sqrt{T}).

Study dynamic Pareto-optimal allocations in multi-period economies with time-consistent risk measures.

problem Optimal allocation in multi-period pure-exchange economies with stochastic endowments and time-consistent risk measures.
method Introduced dynamic Pareto-optimal allocation processes and derived recursive and comonotone improvement theorems.
result Dynamic Pareto-optimal allocation processes can be constructed recursively and are comonotone.

Algorithm identifies Pareto front using multiple context directions and reuses exploration samples.

problem Identifying a set of arms with undominated mean reward vectors in linear bandits.
method Proposes a new estimator that updates estimates along multiple context directions and reuses exploration samples.
result Optimal sample complexity and logarithmic regret compared to optimal algorithms.

New method shows multi-objective bandits are not harder than single-objective ones.

problem Comparing multi-objective bandits to single-objective ones.
method Upper and lower confidence-bound estimators for every arm-objective pair, using top-two races and uncertainty-greedy rule.
result Achieves Pareto regret of \(O( icefrac{\log T}{g^\dagger})\), matching lower bound of \(Ω( icefrac{\log T}{g^\dagger})\).

We have numerically simulated the ideal-gas models of trading markets, where each agent is identified with a gas molecule and each trading as an elastic or money-conserving two-body collision. Unlike in the ideal gas, we introduce (quenched) saving propensity of the agents, distributed widely between the agents ($0 \le…

2003-01-16abs ↗pdf ↗