Study examines maximal domains of radial harmonic functions across different curvature types.
problem Understanding maximal domains of radial harmonic functions in various curvature settings.
method Analysis of harmonic spaces with positive, zero, and negative curvature.
result Characterization of maximal domains for radial harmonic functions in different curvature contexts.
Differentially private algorithms for submodular maximization under various constraints.
problem Maximizing decomposable submodular functions under constraints while preserving privacy.
method Designing differentially private algorithms for both monotone and non-monotone decomposable submodular maximization under general matroid constraints.
result Improved utility guarantees and competitive performance compared to non-private algorithms.
GONs improve predictions of maximizers from noisy black-box functions.
problem Estimating maximizers of noisy black-box functions.
method Global Optimization Networks (GONs) composed of invertible and unimodal functions.
result GONs outperform convex fits, GPR, and DNNs in prediction accuracy.
The paper studies continuous submodular functions and their optimization.
problem Maximizing continuous submodular functions in poly. time.
method Characterization of continuous submodularity, operations preserving it, and algorithms for constrained maximization.
result Continuous submodularity is equivalent to a weak DR property, leading to continuous DR-submodular functions with the full DR property.
The height function of various surfaces decomposes into finite sums of scaled and translated versions of itself.
problem Decomposing the height function of different types of surfaces into simpler components.
method Using Euler-Ramanujan identities and Weierstrass-Enneper representation to decompose height functions of minimal, maximal, timelike minimal, and Born-Infeld surfaces.
result The height function of various surfaces can be expressed as a finite sum of scaled and translated versions of itself.
Fast algorithms developed for adaptive and fully adaptive submodular maximization problems.
problem Maximizing submodular functions subject to constraints in linear time.
method Developed linear-time algorithms for two submodular maximization problems: adaptive and fully adaptive.
result Achieved (1−1/e−ε) approximation ratio for adaptive submodular maximization and $ rac{1-1/e-ε}{4-2/e-2ε}$ for fully adaptive submodular maximization. Study private submodular maximization in streaming data.
problem Private maximization of submodular functions in streaming data.
method Established differentially private baselines and derived better trade-offs for decomposable submodular functions.
result Improved trade-offs between privacy and utility for decomposable submodular functions.
We address the problem of maximizing an unknown submodular function that can only be accessed via noisy evaluations. Our work is motivated by the task of summarizing content, e.g., image collections, by leveraging users' feedback in form of clicks or ratings. For summarization tasks with the goal of maximizing coverage…
We consider learning of submodular functions from data. These functions are important in machine learning and have a wide range of applications, e.g. data summarization, feature selection and active learning. Despite their combinatorial nature, submodular functions can be maximized approximately with strong theoretical…
Algorithm improves recommendation subset selection in the presence of biases.
problem Maximizing submodular functions for recommendation in the presence of social biases.
method Algorithm for submodular maximization with fairness constraints.
result Algorithm provably outputs subsets with near-optimal utility and proportional representation.
New method improves submodular maximization for machine learning applications.
problem Inexact monotonicity in submodular functions limits traditional algorithms' performance.
method Introduces monotonicity ratio as a continuous version of monotonicity, leading to improved approximation guarantees.
result Improved approximation ratios for movie recommendation, quadratic programming, and image summarization.
Bayesian optimization is a sample-efficient approach to global optimization that relies on theoretically motivated value heuristics (acquisition functions) to guide its search process. Fully maximizing acquisition functions produces the Bayes' decision rule, but this ideal is difficult to achieve since these functions …
In this paper, we introduce a novel technique for constrained submodular maximization, inspired by barrier functions in continuous optimization. This connection not only improves the running time for constrained submodular maximization but also provides the state of the art guarantee. More precisely, for maximizing a m…
New method for fair resource allocation in AI-aware networks with unknown utility functions.
problem Fair resource allocation in AI-aware communication networks with unknown utility functions.
method Distributed, data-driven bilevel optimization approach to learn surrogate utility functions.
result The proposed algorithm learns from data to autotune surrogate utility functions for unknown utility functions.
We establish continuous maximal regularity results for parabolic differential operators acting on sections of tensor bundles on Riemannian manifolds. As an application, we show that solutions to the Yamabe flow instantaneously regularize and become real analytic in space and time. The regularity result is obtained by i…
Submodular functions are a broad class of set functions, which naturally arise in diverse areas. Many algorithms have been suggested for the maximization of these functions. Unfortunately, once the function deviates from submodularity, the known algorithms may perform arbitrarily poorly. Amending this issue, by obtaini…
Locally maximizing orbits studied in twist maps and billiards.
problem Characterize orbits in locally maximizing class for twist maps.
method Geometric and variational analysis of orbits in the cotangent bundle of a torus or ball bundle over a sphere.
result Two generating functions for the Birkhoff billiard map have the same class of locally maximizing orbits.
Study maximizes eigenvalues in dimensions 3 and above.
problem Maximizing the k-th eigenvalue functional over measures on Riemannian manifolds.
method Generalizes previous work on first eigenvalue to higher dimensions, proving optimal bounds on singular set dimensions.
result Optimal upper bound for Hausdorff dimension of singular set is m-7.
Optimizes portfolios using CPT utility via convex optimization.
problem Maximizing CPT utility in portfolio selection.
method Minorization-maximization (MM) algorithm and convex-concave (CC) procedure.
result Problems can be solved globally and efficiently.
Study feature representations induced by dependence between variables.
problem Learning feature representations from dependent random variables.
method Characterized sufficient and necessary conditions for dependence-induced representations, and provided a family of loss functions.
result Features learned from the family of loss functions can be expressed as the composition of a loss-dependent function and the maximal correlation function.
New algorithm for maximizing submodular functions in real-time data changes.
problem Maximizing submodular functions under dynamic constraints.
method Randomized algorithm with O(k2) amortized update time. result 4-approximate solution to submodular maximization problem.
The study connects minimal and maximal surfaces in 3D and 3-L space.
problem Describing correspondences between minimal and maximal surfaces in different spaces.
method Weierstrass representation and asymptotic analysis.
result Established criteria for singularity types and moduli spaces.
Study on robust utility maximization with nonconcave utility functions under projective determinacy.
problem Investor's optimal investment strategy under model ambiguity and nonconcave utility.
method Projective functions of the path and sets of priors, upper-semicontinuous utility.
result Existence of optimal investment strategy under PD.
In the lorentzian product Gn×R1, we give a comparison between the f-volume of an entire f-maximal graph and the f-volume of the hyperbolic Hr+ under the assumption that the gradient of the function defining the graph is bounded away from 1. As a consequence, we obtain a Bernstein type theor…
Study proves boundedness of operators in variable exponent Morrey spaces.
problem Boundedness of operators in global Morrey-type spaces with variable exponents.
method Analysis of Hardy-Littlewood maximal operator and potential type operator in variable exponent Morrey spaces.
result Boundedness of the Hardy-Littlewood maximal operator and potential type operator in global Morrey-type spaces with variable exponents.
New method improves BO's AF maximizer initialization for high-dimensional problems.
problem Challenges in maximizing acquisition functions in high-dimensional Bayesian optimization.
method Proposes a heuristic optimizer-based initialization approach to improve AF maximizer performance.
result Our approach significantly enhances BO performance in most test cases.
On a complete Calabi-Yau manifold M with maximal volume growth, a harmonic function with subquadratic polynomial growth is the real part of a holomorphic function. This generalizes a result of Conlon-Hein. We prove this result by proving a Liouville type theorem for harmonic 1-forms, which follows from a new local …
Inexact acquisition solutions in BO lead to sublinear cumulative regret.
problem Inexact maximization of acquisition functions in Bayesian optimization.
method Define inaccuracy measure, establish cumulative regret bounds for GP-UCB and GP-TS.
result Inexact BO algorithms can achieve sublinear cumulative regret under appropriate inaccuracy conditions.
In the large financial market, which is described by a model with countably many traded assets, we formulate the problem of the expected utility maximization. Assuming that the preferences of an economic agent are modeled with a stochastic utility and that the consumption occurs according to a stochastic clock, we obta…
Several uniqueness results on compact maximal hypersurfaces in a wide class of sta- bly causal spacetimes are given. They are obtained from the study of a distinguished function on the maximal hypersurface, under suitable natural first order conditions of the spacetime. As a consequence several applications to Geometri…
We define a generalized likelihood function based on uncertainty measures and show that maximizing such a likelihood function for different measures induces different types of classifiers. In the probabilistic framework, we obtain classifiers that optimize the cross-entropy function. In the possibilistic framework, we …
We give a general formulation of the utility maximization problem under nondominated model uncertainty in discrete time and show that an optimal portfolio exists for any utility function that is bounded from above. In the unbounded case, integrability conditions are needed as nonexistence may arise even if the value fu…
MINIMALIST maximizes mutual information for likelihood estimation from simulated data.
problem Learning model parameters from likelihood functions that cannot be computed.
method Maximizes mutual information between simulated data and model parameters using neural networks.
result Different methods aiming at the same optimal energy form can be directly benchmarked.
In this paper we study a robust expected utility maximization problem with random endowment in discrete time. We give conditions under which an optimal strategy exists and derive a dual representation for the optimal utility. Our approach is based on a general representation result for monotone convex functionals, a fu…
New technique prevents Q-learning collapse by maximizing diversity among ensembles.
problem Value function collapse in ensemble Q-learning.
method Maximizing representation diversity through regularization.
result Regularized approach significantly outperforms existing methods.
It is known that any maximal space-like surface without isotropic points in the four-dimensional pseudo-Euclidean space with neutral metric admits locally geometric parameters which are special case of isothermal parameters. With respect to such parameters the surface is determined uniquely up to a motion by the Gauss …
Study robust utility maximization with uncertain continuous semimartingales.
problem Maximizing utility in continuous time under model uncertainty.
method Duality and conjugate problems for logarithmic, exponential, and power utilities.
result Existence of optimal portfolios for various utilities.
The study finds that maximizing median returns is the only viable strategy in portfolio selection.
problem Difficulties in studying optimal portfolio strategies due to discontinuity and time inconsistency in maximizing median and quantile returns.
method Used intra-personal equilibrium approach to analyze portfolio selection under median and quantile maximization.
result Median maximization is the only viable strategy, with no investment in risky assets for other quantiles.
We establish the existence and characterization of a primal and a dual facelift - discontinuity of the value function at the terminal time - for utility-maximization in incomplete semimartingale-driven financial markets. Unlike in the lower- and upper-hedging problems, and somewhat unexpectedly, a facelift turns out to…
Investor maximizes utility from an unknown claim using robust optimization.
problem Maximizing utility from an unknown contingent claim.
method Robust optimization with quantile formulation and variational inequalities.
result Optimal trading strategy and utility indifference price determined.
Adaptive cascade submodular maximization tackles sequential selection under uncertainty.
problem Maximizing expected utility from a set of items with unknown states and continuation probabilities.
method Proposed adaptive cascade submodular functions and a 0.12 approximation algorithm.
result Identified a class of functions (adaptive cascade submodular) that many practical applications satisfy.
The paper analyzes generalization of noisy, iterative algorithms using maximal leakage.
problem Analyzing the generalization behavior of noisy, iterative learning algorithms.
method Information-theoretic framework with maximal leakage metric.
result Explicit upper bounds on maximal leakage for various scenarios.
New approach solves utility maximization problems using Delta family.
problem Utility maximization in stochastic control problems.
method Directly solving DP equation with Delta function representation.
result Explicit series representation of value function.
In this paper, we consider the problem of black box continuous submodular maximization where we only have access to the function values and no information about the derivatives is provided. For a monotone and continuous DR-submodular function, and subject to a bounded convex body constraint, we propose Black-box Contin…
Submodular function maximization finds application in a variety of real-world decision-making problems. However, most existing methods, based on greedy maximization, assume it is computationally feasible to evaluate F, the function being maximized. Unfortunately, in many realistic settings F is too expensive to evaluat…
We prove a lower bound on the number of maximally broken trajectories of the negative gradient flow of a Morse-Smale function on a closed aspherical manifold in terms of integral (torsion) homology.
The paper explores Kähler-Ricci solitons with maximal symmetry in complex dimension two.
problem Characterizing Kähler-Ricci solitons with maximal symmetry.
method Analyzes the isometry group and uses cohomogeneity one and Sasakian models.
result In complex dimension two, every non-trivial gradient Kähler-Ricci soliton has maximal symmetry.
StoSOO optimistically maximizes noisy, locally smooth functions.
problem Global maximization of noisy, locally smooth functions with unknown semi-metric.
method StoSOO uses optimistic upper confidence bounds to iteratively decide on the next evaluation point.
result StoSOO performs almost as well as the best tuned algorithms, even without knowing the semi-metric.