InSphereNet uses infilling spheres for 3D object classification, improving accuracy with fewer parameters.
problem 3D object classification using points, voxels, or images.
method Constructs infilling spheres from signed distance field (SDF) for classification.
result InSphereNet achieves superior accuracy with fewer inputs and parameters.
Physical systems are modelled and investigated within simulation software in an increasing range of applications. In reality an investigation of the system is often performed by empirical test scenarios which are related to typical situations. Our aim is to derive a method which generates diverse test scenarios each re…
ICP improves text infilling and POS tagging with valid confidence sets.
problem Statistical reliability of machine learning predictions.
method Inductive conformal prediction algorithms for text infilling and POS tagging.
result Valid set-valued predictions with small size for real-world applications.
RaMViD uses diffusion models for video prediction and infilling.
problem Predicting and infilling missing information in videos.
method Extends image diffusion models to videos using 3D convolutions and a new conditioning technique.
result Achieves state-of-the-art results on video prediction benchmarks.
Recent years have seen remarkable progress of text generation in different contexts, such as the most common setting of generating text from scratch, and the emerging paradigm of retrieval-and-rewriting. Text infilling, which fills missing text portions of a sentence or paragraph, is also of numerous use in real life, …
Anticipatory model generates music with control over events.
problem Controlling symbolic music generation.
method Interleaving event and control sequences to predict future events.
result Anticipatory model matches autoregressive models in performance and can infill control tasks.
Model infers mineral locations from geospatial data, improving predictions with auxiliary data.
problem Challenges in characterizing hidden mineral deposits underground.
method Generative modeling approach using masked and infilled geospatial maps.
result Models achieve Dice coefficients of 0.31 and recalls of 0.22 at 1×1 mi² resolution.
Unified perspective unites Bayesian optimization and active learning for efficient goal-oriented optimization.
problem Efficiently optimize expensive engineering and scientific problems with limited data.
method Unified framework linking Bayesian infill criteria and active learning criteria.
result Unified approach formalizes Bayesian infill criteria and active learning criteria.
A new method for high-dimensional Bayesian optimization.
problem Challenges in extending BO to high dimensions.
method Expected Coordinate Improvement (ECI) criterion for high-dimensional Bayesian optimization.
result Significantly better results than standard BO and competitive results with state-of-the-art methods.
We present mlrMBO, a flexible and comprehensive R toolbox for model-based optimization (MBO), also known as Bayesian optimization, which addresses the problem of expensive black-box optimization by approximating the given objective function through a surrogate regression model. It is designed for both single- and multi…
Study improves accuracy of weather data for real-time building simulations.
problem Anomalous and missing weather data affect real-time building energy simulations.
method Introduces a framework for quality control of measured weather data using anomaly detection and neural network infilling.
result Neural Networks enhance the accuracy of data imputation compared to traditional methods.
We use SMC with twist functions to improve probabilistic inference in LLMs.
problem Improving probabilistic inference in large language models.
method We use Sequential Monte Carlo with learned twist functions to estimate expected future values and focus inference on promising sequences.
result Twisted SMC improves the accuracy of language model inference and evaluation.
Paper introduces TtT, market-implied transition time, from greenium term structure.
problem Estimating market-implied transition time to a low-carbon economy.
method Develops inference theory for TtT, introduces two stochastic models.
result Combines two-layer analysis for consistent estimation of diffusion parameters.
In this paper, a new sequential surrogate-based optimization (SSBO) algorithm is developed, which aims to improve the global search ability and local search efficiency for the global optimization of expensive black-box models. The proposed method involves three basic sub-criteria to infill new samples asynchronously to…
Bayesian Optimization tackles hidden constraints in architecture optimization.
problem Optimizing system architectures with hidden constraints using expensive physics-based simulations.
method Surrogate-based optimization with Gaussian Process models, including strategies for handling failed evaluations.
result Best performance achieved with a mixed-discrete GP predicting Probability of Viability (PoV) and minimum PoV threshold selection.
This paper presents the nonparametric inference for nonlinear volatility functionals of general multivariate Itô semimartingales, in high-frequency and noisy setting. Pre-averaging and truncation enable simultaneous handling of noise and jumps. Second-order expansion reveals explicit biases and a pathway to bias correc…
Scalarizing functions have been widely used to convert a multiobjective optimization problem into a single objective optimization problem. However, their use in solving (computationally) expensive multi- and many-objective optimization problems in Bayesian multiobjective optimization is scarce. Scalarizing functions ca…
Diffusion models generate music sequences without autoregressive loops.
problem Generating music sequences from symbolic data using diffusion models.
method Parameterize discrete symbolic data in continuous latent space, train diffusion model, generate sequences through reverse process.
result Strong unconditional generation and post-hoc conditional infilling compared to autoregressive models.
Near-future large galaxy surveys will encounter blended galaxy images at a fraction of up to 50% in the densest regions of the universe. Current deblending techniques may segment the foreground galaxy while leaving missing pixel intensities in the background galaxy flux. The problem is compounded by the diffuse nature …
Sparse Gaussian process quantile regression tackles computational challenges in Bayesian quantile regression.
problem Nonconjugacy and computational cost in Gaussian process quantile regression.
method Sparse Gaussian process framework with Laplace approximation, adaptive inducing-input placement, and sequential data acquisition.
result Accuracy of Laplace approximation and effectiveness of adaptive mechanisms in reducing predictive uncertainty.
A scalable portfolio approach speeds up Bayesian optimization for noisy functions.
problem Efficiently selecting multiple designs in parallel for noisy, expensive black-box optimization.
method A portfolio approach that balances exploration and exploitation, using a scalable allocation strategy.
result Significant speed improvements over existing methods, with similar or better performance.
New scalarizing functions improve multi-objective Bayesian optimisation.
problem Improving multi-objective Bayesian optimisation efficiency.
method Comparing two infill criteria based on hypervolume improvement.
result Effective scalarizing functions enhance hypervolume maximisation.
New method boosts performance of diffusion models on discrete data like natural language.
problem Performance of diffusion models on discrete data like natural language is poor.
method Proposes score entropy, a novel loss that extends score matching to discrete spaces.
result Significantly boosts performance on language modeling tasks.
Bayesian optimal design of experiments (BODE) has been successful in acquiring information about a quantity of interest (QoI) which depends on a black-box function. BODE is characterized by sequentially querying the function at specific designs selected by an infill-sampling criterion. However, most current BODE method…
In this paper, we propose a new threshold-kernel jump-detection method for jump-diffusion processes, which iteratively applies thresholding and kernel methods in an approximately optimal way to achieve improved finite-sample performance. We use the expected number of jump misclassifications as the objective function to…
In the field of multi-objective optimization algorithms, multi-objective Bayesian Global Optimization (MOBGO) is an important branch, in addition to evolutionary multi-objective optimization algorithms (EMOAs). MOBGO utilizes Gaussian Process models learned from previous objective function evaluations to decide the nex…
New CH covariance class improves spatial statistics by balancing differentiability and tail behavior.
problem Lack of control over mean-square differentiability and tail behavior in Matérn covariance functions.
method Developed a new Confluent Hypergeometric (CH) covariance class using a scale mixture of Matérn and polynomial covariances.
result The CH class offers improved theoretical properties and better performance in extrapolative settings.
New research finds 145 infinite families of CS spheres are standard.
problem Determining which Cappell-Shaneson spheres are diffeomorphic to the standard 4-sphere.
method Using Kirby calculus and new families of CS spheres.
result Proves 145 new infinite families of CS spheres are standard.
Every smooth 4-sphere is the same as the standard one.
problem Identifying smooth 4-spheres.
method Proved diffeomorphism to the standard 4-sphere.
result Smooth homotopy 4-spheres are diffeomorphic to the 4-sphere.
Kervaire's sphere-link is equivalent to a ribbon sphere-link, simplifying complex 2-complexes.
problem Understanding the structure of 2-complexes and their asphericity.
method Using Kervaire's sphere-link and ribbon sphere-link equivalence, analyzing the compact complement of ribbon disk-links.
result Every connected subcomplex of a contractible finite 2-complex is aspherical.
New theory proves infinite homology 3-spheres in homology 4-spheres.
problem Existence of homology 3-spheres in homology 4-spheres.
method Diagrammatics of surface cross sections, Taubes' work.
result Infinite number of homology 3-spheres in homology 4-spheres.
The 3-sphere has either 2 minimal 2-spheres or an optimal foliation by 2-spheres.
problem Proving existence of minimal 2-spheres or optimal foliations in arbitrary Riemannian 3-spheres.
method Analyzing the properties of arbitrary Riemannian metrics on 3-spheres.
result The existence of at least two minimal 2-spheres or an optimal foliation in 3-spheres with arbitrary metrics.
Infinitely many splitting spheres found for unlinked 2-spheres in 4-space.
problem Existence of pairwise non-isotopic splitting spheres for unlinked 2-spheres in 4-space.
method Analytical proof showing non-isotopic spheres.
result Infinitely many non-isotopic splitting spheres found.
Reduces weak reducing pairs to spheres in 3-sphere Heegaard surfaces.
problem Finding reducing spheres for weak reducing pairs in Heegaard surfaces.
method Proves existence of reducing spheres for weak reducing pairs in 3-sphere Heegaard surfaces.
result Reduction of weak reducing pairs to spheres if genus is at most 3.
The study shows how to construct d-spheres from (d−1)-spheres and d-balls without additional vertices.
problem Constructing d-spheres from (d−1)-spheres and d-balls without additional vertices. method Examining specific types of spheres (flag, stacked, join of spheres) and d-balls to determine if constructions can be made without extra vertices. result Affirmative answers to constructing d-spheres from (d−1)-spheres and d-balls without additional vertices for certain types of spheres and d-balls. New proof for sphere recognition algorithm.
problem Sphere recognition algorithm proof.
method New proof of a lemma in Abigail Thompson's algorithm.
result New proof of a lemma in Abigail Thompson's proof of the Recognition Algorithm for 3-spheres.
Proves stability of convex spheres with similar geodesic lengths.
problem Stability of convex spheres with specific geodesic properties.
method Proves C^0 Cheeger-Gromov closeness to the round sphere.
result Strictly convex 2-spheres are close to the round sphere.
Soliton spheres are immersed 2-spheres in the conformal 4-sphere S^4=HP^1 that allow rational, conformal parametrizations f:CP^1->HP^1 obtained via twistor projection and dualization from rational curves in CP^{2n+1}. Soliton spheres can be characterized as the case of equality in the quaternionic Pluecker estimate. A …
Study on sphere immersions and their stability indices.
problem Analyzing the stability of sphere immersions.
method Calculation of Morse indices and stability indices for specific sphere immersions.
result Bounds on stability index of associative cone in R7. The paper constructs biharmonic maps between spheres using polynomial maps.
problem Creating biharmonic maps between spheres.
method Using harmonic homogeneous polynomial maps of different degrees to generate proper biharmonic maps.
result Established a method for constructing proper biharmonic product maps.
Classification of constant curvature surfaces in Berger spheres.
problem Identifying complete rotationally invariant surfaces with constant Gauss curvature in Berger spheres.
method Complete classification through detailed analysis of Clifford tori and spheres.
result Rotationally invariant spheres with constant Gauss curvature are the only topological spheres in Berger spheres for K>KP. Characterizes a specific type of convex curves on a 3-sphere.
problem Understanding convex curves on a 3-sphere.
method Decomposes curves on 3-sphere into 2-sphere curves, characterizes locally convex ones.
result Completely characterized a class of convex curves on the 3-sphere.
Reduces connectivity problem for genus-4 Heegaard surface in 3-sphere.
problem Connectivity problem in reducing sphere complex for genus-4 Heegaard surface.
method Presented a sufficient condition for a non-separating weak reducing pair to be separated by a reducing sphere.
result Reduced connectivity problem to showing disjointness of representative reducing spheres from a fixed disk.
Paper studies inscribed sphere and lines through centers of Apollonius spheres in n dimensions.
problem Tangency of spheres and lines through their centers.
method Lie sphere geometry and two-step construction of Apollonius spheres.
result Center of inscribed sphere coincides with point PX. Author provides an alternate proof of the free ribbon lemma.
problem Proving that every free sphere-link in the 4-sphere is a ribbon sphere-link.
method An alternate proof of the free ribbon lemma.
result Provides an alternate proof of the free ribbon lemma.
Sharp convergence theorem for sphere submanifolds proved.
problem Sphere submanifolds in spheres.
method Proved a sharp convergence theorem.
result New differentiable sphere theorem for submanifolds in spheres.
In the 1-parameter family of Berger spheres S^3(a), a > 0 (S^3(1) is the round 3-sphere of radius 1) we classify the stable constant mean curvature spheres, showing that in some Berger spheres (a close to 0) there are unstable constant mean curvature spheres. Also, we classify the orientable compact stable constant mea…
We introduce and study a new class of homotopy spheres called Farrell-Jones spheres. Using Farrell-Jones sphere we construct examples of closed negatively curved manifolds M2n, where n=7 or 8, which are homeomorphic but not diffeomorphic to complex hyperbolic manifolds, thereby giving a partial answer to a que…