The paper develops algorithms to minimize misallocation and identify the arm with the highest variance.
problem Minimizing misallocation and identifying the arm with the highest variance from a set of arms.
method Developed novel online algorithms UCB-VV for misallocation minimization and SHVV for fixed budget best arm identification.
result The algorithms achieve optimal performance in terms of misallocation and error probability.
We study a novel machine learning (ML) problem setting of sequentially allocating small subsets of training data amongst a large set of classifiers. The goal is to select a classifier that will give near-optimal accuracy when trained on all data, while also minimizing the cost of misallocated samples. This is motivated…
Study optimal policies under budget and coverage constraints.
problem Optimal policy learning with budget and coverage constraints.
method Combination of knapsack structure, affine threshold rule, linear programming relaxation, Greedy-Lagrangian (GLC), and rank-and-cut (RC) algorithms.
result GLC closely approximates the optimal solution and achieves near-optimal performance in finite samples; RC is approximately optimal under certain conditions.
CoTj improves diffusion model quality and stability via graph planning.
problem Rigidity in diffusion models due to high-dimensional state space.
method Chain-of-Trajectories (CoTj) framework using Diffusion DNA for graph planning.
result CoTj discovers context-aware trajectories improving output quality and stability.
Predictive policing models can be biased by differential crime reporting rates.
problem Bias in predictive policing models due to differential crime reporting.
method Simulation based on Bogotá, Colombia's victimization and crime reporting data.
result Differential crime reporting rates can lead to misallocation of police patrols.
Chinchilla Approach 2 biases neural scaling law estimates, leading to unnecessary compute costs.
problem Systematic biases in Chinchilla Approach 2's parabolic fits of neural scaling laws.
method Analyzes three sources of error: IsoFLOP sampling grid width, uncentered sampling, and loss surface asymmetry.
result Chinchilla Approach 3 largely eliminates these biases, offering a more convenient or scalable alternative.
AI could democratize education but risks inequality.
problem AI risks creating educational inequality.
method Speculation and posing questions on AI in education.
result AI could exacerbate educational inequality.
Minimal networks minimize length and mass in certain configurations.
problem Finding minimal networks that minimize length and mass.
method Global and local calibrations to prove minimization properties.
result Minimal networks minimize mass and interfaces in partitions.
The study finds conditions for area-minimizing cones over submanifolds.
problem Conditions for area-minimizing cones over submanifolds.
method General configuration results for area-minimizing cones.
result Cone over the minimal product of submanifolds and spheres are area-minimizing.
The paper studies deformations of singular minimal hypersurfaces in dimensions 7 and above.
problem The behavior of singular minimal hypersurfaces in dimensions 7 and above.
method Analyzes the local behavior of minimal hypersurfaces under perturbations and convergence of families of hypersurfaces.
result Existence and smoothness of nearby minimal hypersurfaces under perturbations, uniqueness of homological minimization, and existence of Jacobi fields.
Minimal surfaces in 3-sphere created by reflections from polygons, with new examples based on pentagons.
problem Constructing minimal surfaces in 3-sphere using reflections.
method Minimal n-gon solves free boundary problem; curvature lines combinatorics investigated. result New examples of minimal reflection surfaces based on pentagons.
Study on minimal surfaces in a 3D space with 2m-norm.
problem Characterizing minimal surfaces in a specific geometric space.
method Examining translation, homothetical, and separable minimal surfaces.
result New insights into minimal surfaces in a 3D space with 2m-norm.
Some elementary considerations are presented concerning Catenoids and their stability, separable minimal hypersurfaces, minimal surfaces obtainable by rotating shapes, determinantal varieties, minimal tori in S3, the minimality in Rnk of the ordered set of k orthogonal equal-length n-vectors, and U(1)-invariant minimal…
Study counts minimal surfaces in curved 3D spaces, finding hyperbolic space minimizes area.
problem Counting minimal surfaces in negatively curved 3-manifolds.
method Introduced an asymptotic quantity to count area-minimizing surfaces and showed minimization by hyperbolic metric.
result Hyperbolic metric minimizes the quantity of area-minimizing surfaces in negatively curved 3-manifolds.
Proves unique continuation for area minimizing currents.
problem Ensuring area minimizing currents match minimal surfaces.
method Analyzes infinite order contact between currents and minimal surfaces.
result Currents and minimal surfaces coincide in a neighborhood.
New inequality helps map stability in minimal surfaces.
problem Stability of minimal surfaces in Rn. method Developing new inequalities and perspectives on minimal surfaces.
result Reproves instability of classical minimal surfaces like Enneper.
Minimal submanifolds in spheres can be produced via Clifford type minimal products, and their Morse indices and nullities are calculated.
problem Understanding the properties of minimal submanifolds in spheres via Clifford products.
method Analyzing the first eigenfunctions and Morse indices of minimal products of minimal submanifolds.
result The Morse index and nullity of the minimal product are calculated and shown for specific cases.
Round balls minimize liquid drop model volumes ≤ 1.
problem Minimizing volumes in liquid drop models.
method Proved uniqueness of minimizers for small volumes.
result Round balls uniquely minimize volumes ≤ 1.
Minimal generating sets of Reidemeister moves identified and classified.
problem Classifying minimal generating sets of Reidemeister moves.
method Determined minimal generating sets, provided classifications, and identified candidates.
result 12 out of 16 candidates for minimal generating sets were proven minimal.
The paper creates symmetrical discrete minimal nets using Schwarz reflection.
problem Creating symmetrical discrete minimal nets.
method Extending Schwarz reflection principle to discrete minimal surfaces.
result Global examples of discrete minimal nets with high symmetry.
In this paper, we prove that every conformal minimal immersion of a compact bordered Riemann surface M into a minimally convex domain D⊂R3 can be approximated, uniformly on compacts in M˚=M∖bM, by proper complete conformal minimal immersions M˚→D. We also obtain a …
We prove that there are no minimal hypersurfaces properly immersed in any region of the Euclidean space bounded by unstable minimal cones. We also prove the analogous result for r-minimal hypersurfaces.
New minimal surfaces grow area very quickly.
problem Understanding minimal surfaces with rapid area growth.
method Examples of minimal immersions in Euclidean space.
result Proper minimal surfaces with rapid area growth found.
New minimal surfaces found with Cantor ends in convex domains.
problem Finding complex structures for minimal surfaces with Cantor ends.
method Proving existence of complete minimal surfaces with Cantor ends in minimally convex domains.
result Existence of a Cantor set whose complement forms a complete minimal surface.
Study on minimal hypersurfaces in a special normed space.
problem Characterizing minimal hypersurfaces in a specific normed space.
method Investigate translation and separable minimal hypersurfaces.
result New insights into the properties of minimal hypersurfaces.
Minimal surfaces help compare geometric shapes.
problem Comparing different geometric shapes.
method Applications of minimal surfaces.
result New insights into geometric comparisons.
The study proves that certain stable minimal hypersurfaces must be cylindrical.
problem Characterizing stable minimal hypersurfaces in Euclidean space.
method Analyzing the density at infinity and using stable area minimizing hypercone properties.
result Stable minimal hypersurfaces with specific conditions are cylindrical.
Proves minimal crossing diagrams for specific spatial graphs.
problem Proving minimal crossing diagrams for spatial graphs.
method Analyzing adequate diagrams and replacing vertices and edges.
result All 1-vertex spatial graphs with adequate diagrams have minimal crossing number.
Minimal partitions with minimal perimeter found in metric spaces.
problem Finding minimal partitions with minimal perimeter in metric spaces.
method Existence proof and regularity analysis of minimal domains.
result Existence and regularity of minimal partitions in various metric spaces.
The paper studies minimal submanifolds with specific curvature properties in Euclidean space.
problem Minimal submanifolds with (n−2)-umbilical properties in Euclidean space. method Established a correspondence and developed a Weierstrass type method for local parametrization.
result Minimal, generic, (n−2)-umbilic submanifolds are (n−2)-rotational and have a parametric description. This paper solves minimal surface equations near Hardt-Simon foliations.
problem Minimal surfaces near Hardt-Simon foliations.
method Uses gluing methods to construct minimal surfaces.
result Constructs minimal surfaces over Hardt-Simon surfaces and near quadratic cones.
This paper proves all Pfaffian varieties are area-minimizing except hypersurfaces.
problem Proving area-minimizing property of Pfaffian varieties.
method Analyzing families of minimal real matrix varieties and proving area-minimizing property.
result All Pfaffian varieties are area-minimizing except hypersurfaces.
This paper finds all prime alternating knots with minimal warping degree two.
problem Finding knots with minimal warping degree.
method Examined all prime alternating knots and determined those with minimal warping degree two.
result All prime alternating knots with minimal warping degree two were identified.
Minimal graphs over simply connected domains grow at most exponentially.
problem Growth of minimal graphs over simply connected domains with boundary values 0.
method Analyzing solutions to the minimal surface equation.
result Minimal graphs have at most exponential growth.
Study area minimizing currents in conformal cones, solving Dirichlet problems.
problem Area minimizing currents in conformal cones.
method Minimizing problem of area functionals, Dirichlet problem of minimal surface equations.
result Existence and uniqueness of area minimizing currents in a wide class of conformal manifolds.
Paper proves stable minimal surfaces in 3D are flat.
problem Understanding stable minimal surfaces in 3D.
method Analyzes quadratic area growth and stability conditions.
result Stable minimal Plateau surfaces in 3D are flat.
Study minimal surfaces in Kropina 3D space, finding only planes as minimal translation surfaces.
problem Characterizing minimal surfaces in Kropina 3D space.
method Solving partial differential equations to characterize minimal surfaces.
result Only planes are minimal translation surfaces in Kropina 3D space.
Classifies minimal submanifolds in complex hyperbolic spaces.
problem Identifying minimal submanifolds in complex hyperbolic spaces.
method Classification based on extrinsic homogeneity.
result Classification of minimal extrinsically homogeneous submanifolds.
In this paper, by constructing area-nonincreasing retractions, we prove area-minimizing properties of some cones over minimal embeddings of R-spaces.
Cone structures over minimal products can't be calibrated smoothly.
problem Calibrating cones over minimal products with smooth calibrations.
method Extending a key result from [Zha26], showing obstruction.
result Cone structures over minimal products cannot be calibrated by smooth calibrations.
Survey of minimal genus problem progress.
problem Finding the smallest genus surface in 3-manifolds.
method Survey and review of existing research.
result Summarizes recent advancements in the minimal genus problem.
New minimal surfaces found using Toda lattice and integrable systems.
problem Constructing new minimal surfaces with specific genus.
method Using Toda lattice and integrable systems techniques.
result New singly periodic minimal surfaces with genus j(j+1)/2−1. Computes minimal polynomials for generalized Heisenberg groups.
problem None explicitly stated; focus on method.
method Computes minimal polynomials for generalized Heisenberg groups.
result Explicit minimal polynomials for generalized Heisenberg groups.
The ultimate goal of optimization is to find the minimizer of a target function.However, typical criteria for active optimization often ignore the uncertainty about the minimizer. We propose a novel criterion for global optimization and an associated sequential active learning strategy using Gaussian processes.Our crit…
New minimal surfaces found using a modified metric connection.
problem Finding minimal surfaces in Euclidean 3-space.
method Used a special semi-symmetric metric connection instead of the Levi-Civita connection.
result Found non-trivial minimal surfaces other than planes.
Paper defines minimal hypersurfaces in Euclidean and Riemannian spaces.
problem Characterizing minimal hypersurfaces in different spaces.
method Analyzes conditions for hypersurfaces to be minimal or stable.
result Minimal and stable hypersurfaces are hyperplanes in Euclidean spaces and totally geodesic submanifolds in Riemannian manifolds.
This paper proves compactness of conformal Chern-minimal surfaces in Hermitian surfaces.
problem Compactness of conformal Chern-minimal surfaces in Hermitian surfaces.
method Proves compactness through bubble tree limit analysis.
result Compactness of conformal Chern-minimal surfaces is established with bounded area.
New theorem for nonlocal minimal surfaces in any dimension.
problem Classical half-space theorems for minimal surfaces.
method Established a new half-space theorem.
result Result holds in any dimension.