Efficiently constructs prediction bands with minimal assumptions.
problem Uncertainty quantification for nonparametric, heteroscedastic data.
method Semi-definite programming for data-adaptive prediction bands.
result Strong non-asymptotic coverage properties with minimal distributional assumptions.
Method predicts biomarker trajectories with uncertainty bands for Alzheimer's disease.
problem Uncertainty in biomarker predictions poses risks in clinical deployment.
method Conformal prediction for randomly-timed biomarker trajectories.
result Conformal bands achieve desired coverage and are tighter than baseline.
Knots from a specific band sum have similar homologies but are distinct.
problem Cosmetic crossing conjecture for knots from a specific band sum.
method Analyzing knot homologies (Heegaard, instanton, Khovanov) to verify distinctness.
result Knots from the band sum are distinct despite similar homologies.
Two conformal methods create flexible conditional predictive bands without strong assumptions.
problem Achieving asymptotic conditional coverage without strong dependence assumptions.
method Flexible distribution-free conditional predictive bands using density estimators.
result Methods achieve better control of conditional coverage and smaller length than previous methods.
Deep learning optimizes wireless band switching without measurement gaps.
problem Wireless networks waste data during band switching due to measurement gaps.
method Online-learning based classifier models exploiting spatial and spectral correlation.
result 30% improvement in mean effective rates compared to industry standard.
Machine-learning models are capable of capturing the structure-property relationship from a dataset of computationally demanding ab initio calculations. Over the past two years, the Organic Materials Database (OMDB) has hosted a growing number of calculated electronic properties of previously synthesized organic crysta…
Many wireless networks, including 5G NR (New Radio) and future beyond 5G cellular systems, are expected to operate on multiple frequency bands. This paper considers the band assignment (BA) problem in dual-band systems, where the basestation (BS) chooses one of the two available frequency bands (centimeter-wave and mil…
Band-limited training reduces resource usage without sacrificing accuracy.
problem Resource constraints in training Convolutional Neural Networks (CNNs).
method Artificially constraining the frequency spectra of convolutional filters during training.
result CNNs can leverage lower-frequency components effectively, reducing resource usage.
Paper proposes a method to estimate confidence bands for survival random forests.
problem No statistically valid and computationally feasible approach for estimating confidence bands for survival random forests.
method Extending recent developments in infinite-order incomplete U-statistics, the paper proposes an unbiased confidence band estimation.
result The proposed method accurately estimates the confidence band and achieves desired coverage rate.
This paper applies conformal prediction techniques to compute simultaneous prediction bands and clustering trees for functional data. These tools can be used to detect outliers and clusters. Both our prediction bands and clustering trees provide prediction sets for the underlying stochastic process with a guaranteed fi…
We develop a general framework for distribution-free predictive inference in regression, using conformal inference. The proposed methodology allows for the construction of a prediction band for the response variable using any estimator of the regression function. The resulting prediction band preserves the consistency …
Paper proposes a smart neck-band for detecting neck postures using integrated kinematic and kinetic data.
problem Improper neck postures lead to musculoskeletal disorders requiring therapy and rehabilitation.
method Integrated use of kinematic and kinetic data with machine learning algorithms.
result 100% accuracy in predicting neck postures using the proposed platform.
CP-ROC bands improve graph classification accuracy and uncertainty quantification.
problem Uncertainty quantification and robustness to distributional shifts in graph classification.
method Conditional Prediction ROC (CP-ROC) bands for graph classification, developed for TGNNs and adaptable to GNNs.
result Statistically guaranteed coverage for CP-ROC under local exchangeability condition, improving prediction reliability.
Every link is shown to be presentable as a boundary of an unknotted flat banded surface. A (flat) banded link is defined as a boundary of an unknotted (flat) banded surface. A link's (flat) band index is defined as the minimum number of bands required to present the link as boundaries of an unknotted (flat) banded surf…
Data-driven approach discovers molecular photoswitches with separated electronic absorption bands.
problem Engineering photoswitchable molecules with specific electronic absorption bands remains challenging.
method Data-driven discovery pipeline using Gaussian processes for multitask learning.
result Multioutput Gaussian process (MOGP) trained on four photoswitch transition wavelengths outperforms single-task models and TD-DFT.
In conventional chemisorption model, the d-band center theory (augmented sometimes with the upper edge of d-band for imporved accuarcy) plays a central role in predicting adsorption energies and catalytic activity as a function of d-band center of the solid surfaces, but it requires density functional calculations that…
Extend CPS to non-exchangeable settings with observation-specific permutation weights
problem Calibrated predictive bands under distributional shifts
method Encoding distributional shifts through observation-specific permutation weights
result Shift-aware predictive systems remain valid
New method for accurate uncertainty estimation in deep learning predictions.
problem Insufficient methods for assessing prediction uncertainty in deep learning.
method Valid non-parametric bootstrap method for deep neural networks.
result Accurate confidence intervals and simultaneous confidence bands for survival data.
New method for uncertainty analysis in TabPFN, a state-of-the-art tabular transformer.
problem No method for uncertainty decomposition in TabPFN.
method Casted as a Bayesian predictive inference problem, derived variance estimators using predictive CLT.
result Fast to compute credible bands that target epistemic uncertainty and achieve near-nominal frequentist coverage.
Satellite knots can be trivialized by a single band move.
problem Satellite knots and their trivialization.
method Infinite family of satellite knots and a single band move.
result No disjoint band unknotting exists for satellite knots.
Paper proves a noncompact version of Gromov's band-width estimate.
problem Proving a precise upper bound for noncompact Riemannian bands.
method Developed a quantitative partitioned manifold index theory.
result Proved a version of Gromov's band-width estimate for noncompact Riemannian bands.
FFCP improves FCP's speed without sacrificing accuracy.
problem Inefficient feature transformation in FCP.
method Introduces FFCP using Taylor expansion for faster computation.
result FFCP achieves a 50x speedup with comparable accuracy.
Many problems that appear in biomedical decision making, such as diagnosing disease and predicting response to treatment, can be expressed as binary classification problems. The costs of false positives and false negatives vary across application domains and receiver operating characteristic (ROC) curves provide a visu…
Studies in recent years have demonstrated that neural organization and structure impact an individual's ability to perform a given task. Specifically, individuals with greater neural efficiency have been shown to outperform those with less organized functional structure. In this work, we compare the predictive ability …
Study shows upper limit for torical band width with spectral curvature bounds.
problem Understanding the band width of torical bands with spectral curvature constraints.
method Used the warped \( μ\)-bubble method with spectral curvature bounds.
result Upper bound for the band width of torical bands is established.
The goal of this study is to explain and examine the statistical underpinnings of the Bollinger Band methodology. We start off by elucidating the rolling regression time series model and deriving its explicit relationship to Bollinger Bands. Next we illustrate the use of Bollinger Bands in pairs trading and prove the e…
UTOPIA aggregates multiple prediction intervals efficiently.
problem Constructing optimal prediction intervals for various real-world data problems.
method UTOPIA is a universally trainable strategy using linear or convex programming.
result UTOPIA constructs prediction intervals with small average width and high coverage probability.
New rational band moves simplify knot classification.
problem Classifying knots using rational moves.
method Introduced oriented rational band moves and proved their effectiveness.
result Knots that can be unlinkified by rational moves are rationally slice.
We give a short proof that if a non-trivial band sum of two knots results in a tight fibered knot, then the band sum is a connected sum. In particular, this means that any prime knot obtained by a non-trivial band sum is not tight fibered. Since a positive L-space knot is tight fibered, a non-trivial band sum never yie…
We show that a band-connected sum of knots K0 and K1 along a band b is equal to the connected sum K0#K1 if and only if b is a trivial band.
Classifies S1-invariant free boundary minimal annuli and Möbius bands in Bn.
problem Classifying S1-invariant free boundary minimal annuli and Möbius bands in Bn. method Analysis of the spectrum of the Dirichlet-to-Neumann map for S1-invariant metrics. result Existence and classification of S1-invariant free boundary minimal annuli and Möbius bands in Bn. The paper creates nonparametric confidence bands for band-limited functions.
problem Estimating confidence bands for band-limited functions with finite samples and unknown noise.
method Uses Paley-Wiener reproducing kernel Hilbert spaces and gradient-perturbation methods.
result Non-asymptotic guarantees for confidence regions without assuming a parametric model.
New method removes MRI banding without post-processing.
problem MRI banding in reconstructed images.
method Adversarial training to penalize banding structures.
result Superior banding removal compared to baseline.
A new neural network separates singing voices more effectively.
problem Separating singing voices from mixed signals with high accuracy.
method MBR-FCN that processes different frequency bands with varying resolutions and filters.
result The MBR-FCN achieves better performance with fewer parameters.
Paper shows that for torus knots, the pinch number equals the unoriented band unknotting number.
problem Determining the minimum number of band surgeries to unknot torus knots.
method Used the torsion order of unoriented knot Floer homology.
result Pinch number and unoriented band unknotting number coincide for torus knots.
New method finds arbitrage opportunities in fluctuating asset bands.
problem Finding arbitrage opportunities in fluctuating asset bands.
method Formulate as maximizing volatility within a price band, using convex-concave optimization.
result Approximately solves non-convex optimization problem for moving-band arbitrage.
Develops Llarull type theorems for 3D and 4D bands with spectral scalar curvature bounds.
problem Bounding scalar curvature and metric on 3D and 4D bands simultaneously.
method Warped μ-bubble method result Establishes Llarull type theorems for 3D and 4D bands with spectral scalar curvature bounds.
Every classical knot is band-pass equivalent to the unknot or the trefoil. The band-pass class of a knot is a concordance invariant. Every ribbon knot, for example, is band-pass equivalent to the unknot. Here we introduce the long virtual knot concordance group VC. It is shown that for every concordance cla…
Study surfaces in 4-manifolds using banded unlink diagrams.
problem Representing and manipulating immersed surfaces in 4-manifolds.
method Singular banded unlink diagrams and associated moves.
result Every immersed surface can be represented uniquely by a singular banded unlink diagram.
The paper improves nonparametric confidence bands for band-limited functions.
problem Constructing nonparametric simultaneous confidence bands with nonasymptotic and distribition-free guarantees.
method Based on Paley-Wiener reproducing kernel Hilbert spaces, the paper relaxes assumptions, improves noise estimation, and tightens constraints.
result Enhanced confidence bands with improved efficiency and tighter constraints.
Study negative band numbers in braids and links.
problem Characterizing braids with negative band numbers.
method Using Birman, Ko, and Lee's left-canonical form.
result Characterize strongly and almost strongly quasipositive braids.
We introduce a new sparse estimator of the covariance matrix for high-dimensional models in which the variables have a known ordering. Our estimator, which is the solution to a convex optimization problem, is equivalently expressed as an estimator which tapers the sample covariance matrix by a Toeplitz, sparsely-banded…
Paper shows how to embed Möbius bands with many twists and small aspect ratios.
problem Finding the smallest aspect ratio for Möbius bands with many twists.
method Constructs a folded paper ribbon knot to bound the aspect ratio.
result Paper Möbius bands and annuli with any number of half-twists can be embedded with aspect ratio less than 8.
No free boundary Möbius bands exist in a 3D ball.
problem Proving the non-existence of Möbius bands with free boundaries in a 3D ball.
method Analytical proof based on geometric properties.
result Proves the non-existence of free boundary Möbius bands in the unit three-ball.
The functional significance of resting state networks and their abnormal manifestations in psychiatric disorders are firmly established, as is the importance of the cortical rhythms in mediating these networks. Resting state networks are known to undergo substantial reorganization from childhood to adulthood, but wheth…
The paper establishes new band width inequalities for Riemannian bands.
problem Band width inequalities for Riemannian bands.
method Introduced filling enlargeable manifolds and used them to prove band width inequalities.
result If a manifold is filling enlargeable, then the band width is bounded.
Band selection, by choosing a set of representative bands in hyperspectral image (HSI), is an effective method to reduce the redundant information without compromising the original contents. Recently, various unsupervised band selection methods have been proposed, but most of them are based on approximation algorithms …
Paper proves rigidity for spin bands with specific conditions.
problem Proving rigidity for initial data sets on spin bands.
method Using Dirac operator techniques and lightlike imaginary W-Killing spinors. result Obtains slight generalizations of known rigidity results.