CB-SLICE identifies concept-based error slices in deep learning models.
problem Systematic errors in deep learning models on specific groups.
method Concept Bottleneck Models (CBMs) and concept representations.
result CB-SLICE outperforms state-of-the-art methods in error slice identification.
A new method slices and sums radial kernels faster.
problem Fast computation of large kernel sums in kernel methods.
method Random projections to 1D subspaces and QMC for selecting projections.
result QMC-slicing outperforms existing methods on test datasets.
Paper explores properties of slice-matching operators for measure transfer.
problem Efficiently transferring measures in high dimensions.
method Examines an associated slice-matching operator with source, target measures and slicing directions.
result Establishes invariance, equivariance, Lipschitz continuity, and error bounds.
New algorithm reduces dimensionality in federated learning.
problem Estimating central dimension reduction subspace and variable selection in federated learning.
method Federated sparse sliced inverse regression, convex optimization, linearized alternating direction method of multipliers.
result Upper bound of statistical error rate established under heterogeneous setting.
New bounds improve neural network generalization through slicing.
problem Difficulty in evaluating mutual information in high dimensions for neural networks.
method Slicing the parameter space and using disintegrated mutual information and k-sliced mutual information.
result Slicing improves generalization and offers significant computational and statistical advantages.
This work improves scalability of Wasserstein distances in high dimensions.
problem Scalability issues in computing Wasserstein distances in high dimensions.
method Empirical convergence rates, robustness to data contamination, and computational methods.
result Established fast rates and robust estimation risks for sliced Wasserstein distances.
Empower efficient representation of distributions through moment-preserving methods.
problem Representing high-dimensional probability measures efficiently and accurately.
method Empower efficient representation of distributions through moment-preserving methods.
result Empowers efficient and accurate representation of high-dimensional probability measures.
We describe an error in the proof of a key proposition, which was necessary for the proof of the main result. Alternate proofs of the main result are given by Ozsvath-Stipsicz-Szabo and Dai-Hom-Stoffregen-Truong.
A new method for estimating SW from streaming data.
problem Estimating Wasserstein distance from sample streams.
method Introducing a streaming estimator of the 1DW and applying it to all projections.
result Stream-SW achieves more accurate approximation of SW than random subsampling.
Introduces MSW distances to improve SW metrics.
problem Redundant projections in SW distance.
method Imposes Markov structure on projecting directions.
result MSW distances improve SW metrics.
Proposes QMC-based QSW for 3D SW distance.
problem Intractable SW distance in 3D.
method Quasi-Monte Carlo (QMC) for QSW approximations.
result QMC-based QSW improves SW estimation.
A new method approximates the Sliced-Wasserstein distance without random projections.
problem Efficiently approximating the Sliced-Wasserstein distance for machine learning applications.
method Utilizing the concentration of measure phenomenon to develop a deterministic approximation.
result The approximation error goes to zero as the dimension increases, under a weak dependence condition.
Study on r−shake slice knots and proves 0-shake slice knots are slice.
problem Understanding and characterizing r−shake slice knots. method Exploring the relation to corks and proving slice properties.
result Proves 0-shake slice knots are slice.
Proves certain knots are slice without shaking.
problem Identifying slice knots without using traditional methods.
method Direct proof for 0−shake slice knots. result Proves 0−shake slice knots are slice. Proves a special knot type is slice.
problem Characterizing slice knots.
method Proof by contradiction and algebraic topology.
result 0-shake slice knots are indeed slice.
A new method using spherical harmonics approximates the Sliced-Wasserstein distance.
problem Approximating the Sliced-Wasserstein distance between probability measures.
method Spherical Harmonics Control Variates (SHCV) method for Monte Carlo approximation of the SW distance.
result SHCV method provides an improved rate of convergence compared to Monte Carlo for general measures.
In [4]: `The Riley slice of Schottky space', (Proc. London Math. Soc. 69 (1994), 72-90), Keen and Series analysed the theory of pleating coordinates in the context of the Riley slice of Schottky space R, the deformation space of a genus two handlebody generated by two parabolics. This theory aims to give a complete des…
New findings on knots that are both topologically and rationally slice.
problem Understanding knots that are both topologically and rationally slice.
method Analyzing the concordance group of knots in S3. result There are infinitely many topologically slice knots that are strongly rationally slice but not slice.
Regular sliceness implies once-stably decomposable sliceness in symplectizations.
problem Relationship between regular and decomposable Lagrangian cobordisms in symplectizations.
method Stabilization-free strategy and satellite operations.
result Regular sliceness implies once-stably decomposable sliceness.
We consider linear slices of the space of Kleinian once-punctured torus groups; a linear slice is obtained by fixing the value of the trace of one of the generators. The linear slice for trace 2 is called the Maskit slice. We will show that if traces converge `horocyclically' to 2 then associated linear slices converge…
The paper defines new knot genera and finds bounds for stabilization distances.
problem Finding bounds for stabilization distances of symmetric surfaces.
method Defining new knot genera and using them to find bounds.
result Constructs unknotted symmetric 2-spheres without symmetric 3-ball bounds.
New knots found with tough, unsliceable discs.
problem Finding tough knots that can't be sliced smoothly.
method Constructed infinitely many knots with non-approximable slice discs.
result Smoothly sliceable knots have non-approximable slice discs.
The study examines obstructions to links being shake slice.
problem Understanding when links are not shake slice.
method Examined shake concordance and zero surgery manifolds, and provided obstructions based on Arf invariants and algebraic sliceness.
result Links that are shake concordant have homology cobordant zero surgery manifolds, and provided specific obstructions to shake sliceness.
A new slicing method speeds up sliced Wasserstein estimation.
problem Efficiently estimating sliced Wasserstein distance.
method Random-Path Projecting Direction (RPD) for fast sampling.
result RPSW and IWRPSW show favorable performance in training generative models.
A knot is said to be slice if it bounds a smooth properly embedded disk in the 4-ball. We demonstrate that the Conway knot, 11n34 in the Rolfsen tables, is not slice. This completes the classification of slice knots under 13 crossings, and gives the first example of a non-slice knot which is both topologically slice an…
Khovanov homology fails to differentiate certain slice disks.
problem Differentiating roll-spun slice disks from trivial ones.
method Using Khovanov homology and Morse theory.
result Khovanov homology cannot distinguish roll-spun slice disks from trivial ones.
Characterizes values of slice-torus invariants related to knot genus.
problem Understanding the values of slice-torus invariants for knots.
method Characterization based on stable smooth slice genus.
result Existence of slice torus invariants without explicit constructions.
GAN normalizes CT scans for consistent radiomic feature values.
problem Variations in dose levels and slice thickness affect radiomic features sensitivity.
method Used a 3D generative adversarial network (GAN) to normalize reduced dose, thick slice images to normal dose, thinner slice images.
result GAN-based approach led to significantly smaller error in radiomic features.
We show that if the connected sum of two knots with coprime Alexander polynomials is doubly slice, then the Ozsváth-Szabó correction terms as smooth double sliceness obstructions vanish for both knots. Recently, Jeffrey Meier gave smoothly slice knots that are topologically doubly slice, but not smoothly doubly slice. …
The study classifies χ−slice pretzel links and Seifert fiber spaces.
problem Understanding χ−slice pretzel links and their properties. method Analyzing the sliceness of pretzel knots and extending results to pretzel links.
result Complete classifications of positive and negative pretzel links that are χ−slice, and partial classifications of 3-stranded and 4-stranded pretzel links. Paper improves MMD flow efficiency with Riesz kernels for image generation.
problem High computational costs in MMD flows for large scale computations.
method Introduces Riesz kernels and sliced MMD for efficient computation.
result Efficient computation of MMD gradients in one-dimensional setting.
Study slice-regular polynomial functions via twistor space group actions.
problem Characterize slice-regular functions and their polynomial subclasses.
method Employ the twistor construction and group actions of PGL(2,H). result Characterize slice-regular functions with planar twistor lifts and normal classes of polynomials.
The paper shows some Montesinos links can't be doubly sliced strongly.
problem Understanding double sliceness for Montesinos links.
method Using branched double covers and Seifert fibered spaces.
result A large family of Montesinos links are not strongly doubly slice.
Study shows most knots in a family are not slice.
problem Determining which 3-stranded pretzel knots are slice.
method Analyzing a specific infinite family of knots and proving their non-slice properties.
result Four-fifths of the remaining knots in the family are not slice.
A permutation-based SW test achieves minimax-optimal power for two-sample testing.
problem Nonparametric two-sample testing using the sliced Wasserstein distance.
method Proposes a permutation-based SW test and analyzes its performance.
result Achieves minimax separation rate n−1/2 over multinomial and bounded-support alternatives. We use techniques of Freedman and Teichner to prove that, under certain circumstances, the multi-infection of a slice link is again slice (not necessarily smoothly slice). We provide a general context for proving links are slice that includes many of the previously known results.
Study on slicing knots in 4-manifolds, focusing on CP^2-slicing numbers.
problem Understanding the slicing properties of knots in 4-manifolds.
method Lower and upper bounds on CP^2-slicing numbers using double branched covers and Seifert forms.
result Findings on the finite and distinct CP^2-slicing numbers for certain knots.
New algorithm optimizes robust estimation under mixed local and global corruptions.
problem Combining local and global corruptions in robust statistics.
method Information-theoretic approach using sliced-Wasserstein metric.
result Optimal error achieved in polynomial time for stronger local perturbations.
New invariant measures doubly slice links, disproving previous bounds.
problem Understanding doubly slice links and their invariants.
method Introduced new invariant gst to measure doubly slice links and disproved previous bounds. result Examples of links with large doubly slice genus but gst=1. New knots show linear independence in slice concordance.
problem Understanding the structure of rationally slice knots.
method Provided an infinite family of knots that are linearly independent.
result Found knots that are linearly independent and infinite order.
Study shows certain knots can't be sliced using 2-fold branched covers.
problem Determining which algebraically slice knots are actually slice.
method Used d invariants of 2-fold branched covers to show nonsliceness.
result Shows nonsliceness of a set of algebraically slice knots.
Bing doubling is an operation which produces a 2-component boundary link B(K) from a knot K. If K is slice, then B(K) is easily seen to be boundary slice. In this paper, we investigate whether the converse holds. Our main result is that if B(K) is boundary slice, then K is algebraically slice. We also show that the Ras…
In the present paper we extend the definition of slice-torus invariant to links. We prove a few properties of the newly-defined slice-torus link invariants: the behaviour under crossing change, a slice genus bound, an obstruction to strong sliceness, and a combinatorial bound. Furthermore, we provide an application to …
We use recently introduced Rasmussen invariant to find knots that are topologically locally-flatly slice but not smoothly slice. We note that this invariant can be used to give a combinatorial proof of the slice-Bennequin inequality. Finally, we compute the Rasmussen invariant for quasipositive knots and show that most…
We prove that there are infinitely many (1,1)-knots which are topologically slice, but not smoothly slice, which was a conjecture proposed by Béla András Rácz.
The paper calculates the slicing degree of knots using advanced homology theories.
problem Determining the minimum slicing degree of knots.
method Rasmussen's s-invariant, knot Floer homology, and singular instanton homology.
result Computed slicing degrees for many small knots and some families of torus knots.
We study the classification of slice disks of knots up to isotopy and diffeomorphism using an invariant in knot Floer homology. We compute the invariant of a slice disk obtained by deform-spinning, and show that it can be effectively used to distinguish non-isotopic slice disks with diffeomorphic complements. Given a s…
A new approach simplifies Sliced-Wasserstein distances to improve learning performance.
problem The concentration of measure phenomenon makes random projections uninformative in high dimensions.
method Propose rescaling the 1D Wasserstein distance to make all slices equally informative.
result The classical Sliced-Wasserstein, properly configured, can match or surpass complex variants.