Optimal contracts help principals delegate data collection in decentralized ML.
problem Dealing with information asymmetries in decentralized ML.
method Design of optimal and near-optimal contracts addressing uncertainty in model quality and performance.
result Simple linear contracts achieve 1-1/e fraction of optimal utility.
We consider a general framework of optimal mechanism design under adverse selection and ambiguity about the type distribution of agents. We prove the existence of optimal mechanisms under minimal assumptions on the contract space and prove that centralized contracting implemented via mechanisms is equivalent to delegat…
Delegated votes in Uniswap DAO favor parties with less self-owned votes and a16z-affiliated entities.
problem Incentives for vote delegation in decentralized governance systems.
method Analysis of Uniswap governance DAO using vote delegation data.
result Vote delegation patterns suggest window-dressing around decentralization and merit-based delegation.
Forward hedging reshapes incentive provision in firms.
problem How does forward hedging affect incentive provision in firms?
method We consider a CARA framework to jointly characterize optimal production, compensation, and static hedging in equilibrium.
result Delegation and external hedging are partial substitutes, and delegation can increase firm value even when the agent is more risk averse.
Adaptive AI delegation framework for dynamic decision authority allocation.
problem Dynamic allocation of decision authority to AI-generated recommendations under evolving evidence quality and uncertainty.
method Formulated as a Governance-Aware POMDP, using Bayesian inference for informational state estimation and sequential optimization for authority allocation.
result Sequential Bayesian governance provides the strongest general-purpose policy across AI-quality regimes, adapting to evolving evidence.
A study on portfolio delegation with random default times, addressing complex uncertainties.
problem Optimal portfolio delegation with uncertain investment horizon due to random default.
method Developed a theoretical framework using BSDEs and control theory, and deep learning for high-dimensional problems.
result Solutions to integro-partial Hamilton-Jacobi-Bellman equations for both scenarios of default time.
Most known regret bounds for reinforcement learning are either episodic or assume an environment without traps. We derive a regret bound without making either assumption, by allowing the algorithm to occasionally delegate an action to an external advisor. We thus arrive at a setting of active one-shot model-based reinf…
Study on limits of LLM-based multi-agent planning reliability.
problem Reliability limits of LLM-based multi-agent planning.
method Modeling LLM-based multi-agent architecture as a decision network, showing dominance by centralized Bayes decision maker.
result Optimizing multi-agent directed acyclic graphs under communication budget is equivalent to choosing a constrained experiment.
AI task delegation faces incentive collapse with unbounded payments as AI accuracy rises.
problem Incentive collapse in AI-assisted task delegation schemes.
method General impossibility result and sentinel-auditing payment mechanism.
result Sentinel-auditing mechanism enforces positive human effort at finite cost, independent of AI accuracy.
We analyze conditional optimization problems arising in discrete time Principal-Agent problems of delegated portfolio optimization with linear contracts. Applying tools from Conditional Analysis we show that some results known in the literature for very specific instances of the problem carry over to translation invari…
Human-AI teaming suffers from calibration issues.
problem Human-AI teaming
method Assume calibrated models and humans
result Existing methods for combination do not preserve human's calibration.
We analyze and quantify, in a financial market with parameter uncertainty and for a Constant Relative Risk Aversion investor, the utility effects of two different boundedly rational (i.e., sub-optimal) investment strategies (namely, myopic and unconditional strategies) and compare them between each other and with the u…
We propose Lomax delegate racing (LDR) to explicitly model the mechanism of survival under competing risks and to interpret how the covariates accelerate or decelerate the time to event. LDR explains non-monotonic covariate effects by racing a potentially infinite number of sub-risks, and consequently relaxes the ubiqu…
Paper characterizes star-shaped risk measures and their properties.
problem Characterizing risk measures in the presence of liquidity risk and competitive delegation.
method Characterization of star-shaped risk measures, study of their properties.
result Star-shaped risk measures include all practically used risk measures.
Private credit markets have expanded significantly, offering unique lending technology to private equity firms.
problem Understanding the growth and characteristics of private credit markets.
method Systematic survey of academic literature, development of integrated theoretical framework, empirical evidence.
result Private credit markets offer a distinct lending technology with higher spreads over syndicated loans.
As Machine Learning (ML) gets applied to security-critical or sensitive domains, there is a growing need for integrity and privacy for outsourced ML computations. A pragmatic solution comes from Trusted Execution Environments (TEEs), which use hardware and software protections to isolate sensitive computations from the…
In this paper, we construct a solution to the optimal contract problem for delegated portfolio management of the fist-best (risk-sharing) type. The novelty of our result is (i) in the robustness of the optimal contract with respect to perturbations of the wealth process (interpreted as capital injections), and (ii) in …
Study optimal contracts for pandemic risk, offering fixed shares and prevention mechanisms.
problem Optimal delegation contracts in the face of pandemic shutdown risk.
method Dynamic principal-agent model with exogenous early termination risk.
result Explicit characterization of optimal wage and action for prevention mechanisms.
We propose a Monte Carlo simulation method to generate stress tests by VaR scenarios under Solvency II for dependent risks on the basis of observed data. This is of particular interest for the construction of Internal Models and requirements on evaluation processes formulated in the Commission Delegated Regulation. The…
Model for open, decentralized network with task load balancing.
problem Complex computational tasks in open, decentralized networks.
method Incentive-based load balancing using economic mechanisms.
result Optimized resource allocation and enhanced system resilience.
TensorHyper-VQC improves VQC scalability and robustness.
problem Scalability and noise sensitivity in VQC.
method Tensor-train-guided hypernetwork framework.
result TensorHyper-VQC achieves superior performance and robust noise tolerance.
SARD improves adversarial robustness in two-stage L2D systems.
problem Adversarial attacks can manipulate query allocation in two-stage L2D systems.
method Introduces SARD, a convex learning algorithm with provable guarantees.
result SARD significantly improves robustness under adversarial attacks while maintaining strong clean performance.
Framework allows systems to defer difficult decisions to unknown experts.
problem Ensuring safety and robustness in autonomous systems with unknown human experts.
method Meta-learning approach that adapts to new experts at test-time using optimization and model-based attention mechanisms.
result Framework can quickly adapt deferral policies to new experts without re-training.
Study nonconcave portfolio choice with smooth ambiguity and Bayesian learning.
problem Nonconcave portfolio choice under smooth ambiguity and Bayesian learning.
method Developed a general framework for dynamic, non-concave asset allocation.
result Dynamic consistency achieved through a robust representation.
VegasFlow accelerates complex simulations across various hardware platforms.
problem Complex calculations and simulations requiring high-dimensional integrals.
method Monte Carlo integration techniques using Vegas algorithm and TensorFlow.
result Significantly faster performance on various hardware platforms.
The paper extends conformal prediction to MDP trajectories for autonomous systems.
problem Ensuring reliability of autonomous systems by providing probabilistic guarantees.
method Applying conformal corrections to quantile regression prediction intervals.
result Conformal prediction intervals ensure the observed trajectory lies inside with high probability.
Investors usually resort to financial advisors to improve their investment process until the point of complete delegation on investment decisions. Surely, financial advice is potentially a correcting factor in investment decisions but, in the past, the media and regulators blamed biased advisors for manipulating the ex…
We give polynomial-time algorithms for the exact computation of lowest-energy (ground) states, worst margin violators, log partition functions, and marginal edge probabilities in certain binary undirected graphical models. Our approach provides an interesting alternative to the well-known graph cut paradigm in that it …
Unlike other industries in which intellectual property is patentable, the financial industry relies on trade secrecy to protect its business processes and methods, which can obscure critical financial risk exposures from regulators and the public. We develop methods for sharing and aggregating such risk exposures that …
The paper introduces a new algorithm for fair decision-making in outcome control tasks.
problem Fair and equitable automated decision-making in outcome control tasks.
method Causal analysis and optimization to ensure fairness in decision-making.
result Developed an algorithm for maximizing Y while ensuring causal fairness. VFGNN tackles privacy-preserving node classification with federated GNN.
problem Data isolation problem in graph data.
method Vertically partitioned federated GNN, differential privacy.
result Demonstrates effectiveness of VFGNN on three benchmarks.
Glitches cause unreliable AI decisions with steep boundaries.
problem Glitches impair the reliability of AI models with steep decision boundaries.
method Formal definition of glitches, algorithmic search using MILP encoding.
result Glitches are widespread and indicate potential model inconsistencies.
The paper tackles fairness in scoring functions for binary classification.
problem Fairness in scoring functions for binary classification tasks.
method Introduces ROC-based fairness constraints and learning algorithms.
result Generalization bounds and practical learning algorithms for fair scoring functions.
Classical clients can verify quantum learning tasks efficiently.
problem Making quantum learning accessible to classical clients.
method Developed a framework for classical verification of quantum learning.
result Quantum learning tasks can be efficiently verified by classical verifiers.
We present conditions under which positive alpha exists in the realm of active portfolio management- in contrast to the controversial result in Jarrow (2010, pg. 20) which implicates delegated portfolio management by surmising that positive alphas are illusionary. Specifically, we show that the critical assumption used…
Moirai-MoE improves time series forecasting by automatically specializing tokens without human-defined frequency.
problem Unified training on time series data remains challenging due to heterogeneity and non-stationarity.
method Uses sparse mixture of experts (MoE) within Transformers to automatically specialize tokens for diverse time series patterns.
result Moirai-MoE outperforms existing foundation models in both in-distribution and zero-shot scenarios.
LATM framework uses LLMs to create and reuse tools for efficient problem-solving.
problem Improving problem-solving capabilities of LLMs with external tools.
method Closed-loop framework with two phases: tool making and tool using. LLMs act as both tool makers and users. Resource-intensive model for tool making, lightweight model for tool using.
result LATM framework achieves performance equivalent to using a powerful LLM for both roles but with significantly reduced costs.
Investors adjust spending based on a social norm, spending less during losses and more during gains.
problem Managing spending and portfolio decisions while adhering to a social norm.
method Formulated a preference ordering with two CRRA preference orderings, solved analytically and numerically.
result Annual spending should be lower than expected financial return and procyclical, with spending cuts following losses.
Bayesian optimization reduces computational effort in aircraft design optimization.
problem High computational cost in industrial aircraft design optimization.
method Constrained Bayesian optimization (Super Efficient Global Optimization with Mixture of Experts)
result Significant computational efficiency improvements over existing Isight optimizers.
Bayesian optimization method tackles combinatorial spaces, scalable for large data.
problem Optimization over combinatorial categorical spaces in natural sciences.
method Combines variational optimization and continuous relaxations for gradient-based optimization.
result Method performs comparably to state-of-the-art methods while scaling well.
New algorithm solves complex stopping problems with robust optimization.
problem Solving complex stochastic optimal stopping problems.
method Simulation-based robust optimization with exact reformulation as a zero-one bilinear program.
result Developed polynomial-time heuristics and algorithms for practical solution.
L2O uses ML to optimize traditional optimization techniques.
problem Real-world optimization problems with shared structures.
method Exploiting shared structures to enhance optimization techniques.
result Better or faster solutions through machine learning integration.
When hyperparameter optimization of a machine learning algorithm is repeated for multiple datasets it is possible to transfer knowledge to an optimization run on a new dataset. We develop a new hyperparameter-free ensemble model for Bayesian optimization that is a generalization of two existing transfer learning extens…
Meta algorithm solves multivariate optimization using univariate optimizers.
problem Multivariate global optimization problems.
method Meta algorithm combining univariate global optimizers.
result Meta algorithm provides robust regret guarantees.
A novel neural network approach for optimization problems.
problem Constrained optimization problems.
method Neural Optimization Machine (NOM) using a specially designed NN architecture and training procedure.
result Solves optimization problems efficiently, especially in high-dimensional spaces.
New algorithms ensure reproducibility and optimal convergence in convex optimization.
problem Trade-off between reproducibility and convergence rate in convex optimization.
method Regularization-based algorithms for smooth convex minimization and minimax optimization.
result Achieves optimal reproducibility and near-optimal gradient complexity for various oracle settings.
New algorithm selects robust martingale for optimal stopping problems.
problem Optimal stopping problems in stochastic processes.
method Randomized dual martingale minimization algorithm.
result Efficiently selects Doob martingale as close as possible.
Numerical optimization is an important tool in the field of computational physics in general and in nano-optics in specific. It has attracted attention with the increase in complexity of structures that can be realized with nowadays nano-fabrication technologies for which a rational design is no longer feasible. Also, …