New tools quantify deep generative models' performance.
problem Measuring the quality-diversity trade-off in deep generative models.
method Established non-asymptotic bounds on sample complexity and introduced frontier integrals.
result Smoothed estimators improve convergence rates of divergence frontiers.
The paper introduces a machine learning method to forecast market direction using efficient frontier coefficients.
problem Improving asset return estimation for portfolio optimization.
method Monthly directional market forecast using an online decision tree trained on efficient frontier coefficients.
result The method outperforms baseline portfolios and other feature sets.
Neural network approximates weakly efficient frontier of convex vector optimization problems.
problem Approximating the weakly efficient frontier of convex vector optimization problems.
method Designing a neural network architecture to approximate the weakly efficient frontier of convex vector optimization problems (CVOP) satisfying Slater's condition.
result The proposed algorithm effectively approximates the true weakly efficient frontier of CVOPs, even for large problems.
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.
Algorithm maps trade-off between clustering fidelity and representation size.
problem Optimizing trade-off between clustering fidelity and representation size.
method Introduces primal Deterministic Information Bottleneck (DIB) problem for discrete search spaces.
result Shows richer Pareto frontier over Lagrangian relaxation.
A power-law fit to the empirical inference-compute frontier in LOB prediction suggests a scaling-law-style frontier.
problem Limit order book prediction
method Using a suite of models ranging from small decision trees to neural LOB architectures
result A power-law fit to the low- and mid-compute non-MLPLOB frontier extrapolates across multiple orders of magnitude and attains R2=0.941 on the excluded high-compute MLPLOB target frontier. The paper develops methods to estimate the high-dimensional efficient frontier without distributional assumptions.
problem Estimating the mean-variance efficient frontier in high-dimensional settings.
method Random matrix theory and asymptotic analysis for high-dimensional data.
result Developed consistent estimators for the mean, variance, and covariance of the efficient frontier.
GeMA learns latent manifolds to benchmark complex systems.
problem Benchmarking complex systems like rail networks and economies with classical methods.
method Geometric Manifold Analysis (GeMA) using a productivity-manifold variational autoencoder (ProMan-VAE).
result GeMA provides more nuanced efficiency evaluations in complex systems.
This paper tackles sandbagging in AI safety evaluations.
problem AI agents may hide dangerous capabilities to avoid being deactivated.
method Developed a simple model of strategic deception in sequential decision-making tasks.
result Demonstrated that optimal rational agents exhibit sandbagging behavior.
New research shows shrinkage methods re-scale portfolio efficient frontiers under distributional misspecification.
problem Poor performance of mean-variance portfolio decisions under distributional assumptions.
method Investigation of shrinkage methods under different distributional assumptions (auto-correlation, skewness, excess kurtosis).
result Shrinkage methods re-scale the sample efficient frontier, implying standard comparison methods are flawed.
Proposes a diagnostic method to evaluate factor models using cap-axis integrals.
problem Improving factor model evaluation in low-dimensional spaces.
method Lifts pricing errors into a bridge-alpha curve along the market-capitalization rank axis.
result The cap-axis norm is distinct from Sharpe gain and size exposure.
Proposes a diagnostic method to evaluate factor models using cap-axis integrals.
problem Improving factor model evaluation for low-dimensional models.
method Lifts pricing errors into a bridge-alpha curve along the market-capitalization rank axis.
result The cap-axis norm is distinct from Sharpe gain and size exposure.
Enhances hedging strategies using deep neural networks.
problem Optimizing risks and returns in financial hedging.
method Integrates deep neural networks and random forest classifiers to find optimal hedging strategies.
result Improved hedging strategies with lower costs and risks.
Enhances uncertainty modeling in random PDEs using PINNs and generative models.
problem Uncertainty in complex systems modeled by random PDEs.
method Combines Physics-Informed Neural Networks (PINNs) with generative modeling techniques.
result Systematic control of uncertainty with maintained predictive accuracy.
Researchers study fairness-accuracy tradeoffs in predictive models for multiple groups.
problem Understanding the tradeoff between fairness and accuracy in models serving multiple demographic groups.
method Characterizing the fairness-accuracy (FA) Pareto frontier, approximating it from limited data, and bounding the worst-case gap.
result Derivation of worst-case-optimal estimators and uniform finite-sample bounds for the entire FA frontier.
A new asset allocation model uses Markov states from clustered efficient frontier coefficients.
problem Characterizing market regimes using efficient frontiers for better asset allocation.
method Hierarchical clustering of monthly efficient frontier coefficients to define states, then a Markov process on these states for portfolio optimization.
result The model significantly outperforms benchmark portfolios empirically.
The p-index improves investment performance for NYSE stocks but not for SSE stocks.
problem Improving investment performance for stocks using the p-index.
method Comparing different p-ratio strategies and empirical efficient frontiers for SSE and NYSE stocks.
result The p-index enhances investment performance for NYSE stocks but not for SSE stocks.
The profitability of CPMMs is significantly impacted by mint and burn fees.
problem Understanding the profitability of decentralized exchanges.
method Formalized liquidity providers' profitability conditions, studied the effect of mint and burn fees, and compiled a large data set from Uniswap V2 transactions.
result The profitability of liquidity provision is severely affected by mint and burn costs.
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.
P-Trees improve investment performance by optimizing the efficient frontier.
problem Optimizing investment performance in complex financial markets.
method Introducing P-Trees, a new tree-based model for analyzing panel data.
result P-Trees significantly advance the efficient frontier and outperform existing models.
A simplified model for fixed income portfolio optimisation.
problem Modeling interest rates and credit risk in fixed income portfolios.
method Proposes a two-factor model for the time evolution of the efficient frontier.
result The efficient frontier is mainly controlled by linear constraints, with standard deviation less important.
This paper presents an analysis of the study variables such as gdp, employment levels, the level of R & D and technology that will serve as the basis for stochastic modeling of production possibilities frontier in the goodness of fractal dimensions Ex Ante and Ex Post a priori to determine the levels of causality immed…
It is well established that in a market with inclusion of a risk-free asset the single-period mean-variance efficient frontier is a straight line tangent to the risky region, a fact that is the very foundation of the classical CAPM. In this paper, it is shown that in a continuous-time market where the risky prices are …
A research frontier has emerged in scientific computation, wherein numerical error is regarded as a source of epistemic uncertainty that can be modelled. This raises several statistical challenges, including the design of statistical methods that enable the coherent propagation of probabilities through a (possibly dete…
Differentiable relaxation for inferring partial orders from noisy linear data.
problem Inference of partial orders from linear data with noisy observations.
method Introducing a differentiable relaxation to model noisy linear extensions, replacing discontinuous precedence and feasibility with smooth surrogates.
result Smooth posterior that preserves partial-order semantics, supports gradient-based inference, and converges to hard likelihood.
The paper integrates behavioral distortions into portfolio optimization using implied probability weighting functions.
problem Behavioral distortions in probability weighting affect portfolio optimization under different return distributions.
method Developed a unified framework to extract probability weighting functions from optimal portfolios modeled under Gaussian and NIG distributions.
result Increasing tail fatness amplifies behavioral distortions, and shifts in risk-free rates alter the curvature of these distortions.
Deep learning improves portfolio optimization efficiency.
problem Efficient frontier calculation in high-dimensional finance problems.
method Deep neural networks for portfolio optimization with added constraints.
result A new projected feedforward network outperforms classical methods.
Blockchain funds balance risk and return for various investors.
problem Creating diversified portfolios with risk parity for different risk appetites.
method Developed three funds (Alpha, Beta, Gamma) with distinct risk and return profiles, setting weights inversely proportional to risk.
result Blockchain enables investors to select their preferred risk-return combination and allocate wealth accordingly.
We consider the problem of finding the efficient frontier associated with the risk-return portfolio optimization model. We derive the analytical expression of the efficient frontier for a portfolio of N risky assets, and for the case when a risk-free asset is added to the model. Also, we provide an R implementation, an…
This note finds closed-form solutions for mean-risk portfolios using a specific type of mixture distribution.
problem Finding optimal portfolios under mean-risk criteria for general distributions.
method Using normal mean-variance mixture (NMVM) distributions, the paper derives closed-form expressions for mean-risk frontiers by optimizing a Markowitz model with adjusted return vectors.
result Closed-form solutions for mean-risk portfolios are found for return vectors following NMVM distributions.
New algorithm reduces regret in online portfolio and quantum state learning.
problem Efficiently learning portfolios and quantum states online with minimal regret.
method BISONS algorithm for online portfolio selection, SCHRODINGER'S BISONS for quantum states, with polylogarithmic regret.
result First efficient algorithm with polylogarithmic regret for online portfolio selection and quantum states.
Study optimizes fairness in predictive models by balancing utility and separation.
problem Balancing fairness and utility in predictive models.
method Information-theoretic approach using conditional mutual information (CMI).
result Reduces separation violations while maintaining or improving utility.
This paper studies an entropy-based multi-objective Bayesian optimization (MBO). The entropy search is successful approach to Bayesian optimization. However, for MBO, existing entropy-based methods ignore trade-off among objectives or introduce unreliable approximations. We propose a novel entropy-based MBO called Pare…
The paper tackles fair policy targeting by optimizing allocation rules to minimize unfairness.
problem Discrimination in individualized treatments of social welfare programs.
method Formulated as a mixed-integer linear program, solved using off-the-shelf algorithms, derived regret bounds and small sample guarantees.
result Designs fair and efficient treatment allocation rules within the Pareto frontier.
Many domains of science have developed complex simulations to describe phenomena of interest. While these simulations provide high-fidelity models, they are poorly suited for inference and lead to challenging inverse problems. We review the rapidly developing field of simulation-based inference and identify the forces …
We propose a stochastic approximation method for approximating the efficient frontier of chance-constrained nonlinear programs. Our approach is based on a bi-objective viewpoint of chance-constrained programs that seeks solutions on the efficient frontier of optimal objective value versus risk of constraint violation. …
The paper proposes a method to ensure fairness in machine learning models.
problem Ensuring fairness in machine learning models powered by supervised learning.
method Optimal affine transport and Wasserstein-2 barycenter to characterize the Pareto frontier between prediction error and statistical disparity.
result The proposed method effectively balances prediction accuracy and fairness, as demonstrated by numerical simulations.
ML Compass helps organizations choose AI models that balance utility, cost, and compliance.
problem Selecting AI models that meet user utility, deployment costs, and compliance requirements.
method Develops ML Compass, a framework for constrained optimization over a capability-cost frontier, using internal measures and empirical data.
result ML Compass produces deployment-aware recommendations that differ from capability-only rankings, clarifying trade-offs between capability, cost, and safety.
Understanding optimal prompts for binary sequence predictors is challenging.
problem Finding good prompts for binary sequence predictors is difficult.
method Viewing prompting as finding the best conditioning sequence on a near-optimal sequence predictor, using empirical and statistical analysis.
result Optimal prompts can be better understood given the pretraining distribution, which is not usually available.
Handles verify a manifold conjecture.
problem Verifying a conjecture about submanifolds in manifolds.
method Using handlebodies to construct a family of sets.
result A family of sets forms a neighbourhood basis of the manifold.
Parallel Bayesian optimization tackles noisy multi-objective problems.
problem Optimizing multiple objectives with noisy data.
method NEHVI and qNEHVI acquisition functions, integrating Bayesian treatment over uncertainty. result Parallel qNEHVI is one-step Bayes-optimal and robust to noise. ISP improves DNN uncertainty for better subgroup accuracy.
problem Improving accuracy-group robustness in deep neural networks.
method Introspective Self-play (ISP) adds an introspection task to improve bias-awareness and uncertainty.
result ISP improves the accuracy-group robustness trade-off of AL methods.
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.
Study shows awareness of reflexivity improves LLMs' financial forecasting accuracy.
problem Improving LLMs' ability to forecast financial markets during boom-bust cycles.
method Evaluated three LLMs under four conditions of reflexivity awareness in two market episodes.
result Reflexivity awareness improves forecasting accuracy differently across models and contexts.
Let G be a u.s.c decomposition of Sn, HG denote the set of nondegenerate elements and π be the projection of Sn onto Sn/G. Suppose that each point in the decomposition space has arbitrarily small neighborhoods with (n−1)-sphere frontiers which miss π(HG), and such frontiers satisfies the Mismatch P…
The vast majority of optimization and online learning algorithms today require some prior information about the data (often in the form of bounds on gradients or on the optimal parameter value). When this information is not available, these algorithms require laborious manual tuning of various hyperparameters, motivati…
We prove the existence of limits of real-analytic Laplace eigenvalue branches for real-analytic families of metrics that degenerate along a compact hypersurface.
New method improves efficiency analysis with big data.
problem Challenges in detecting inefficiency with big data.
method Post Double LASSO method using Neyman orthogonal moment conditions.
result Improved estimation of efficiency and inefficiency.