Generalizing the theorem of Green--Lazarsfeld and Gromov, we classify Kaehler groups of deficiency at least two. As a consequence we see that there are no Kaehler groups of even and strictly positive deficiency. With the same arguments we prove that Kaehler groups that are non-Abelian and are limit groups in the sense …
Improved UCB method for stochastic bandits using distance tuning.
problem Improving performance in stochastic bandit problems.
method Tuning confidence bounds based on bandit distance.
result Empirically shows increased performance compared to existing methods.
Motivated by the growing popularity of variants of the Wasserstein distance in statistics and machine learning, we study statistical inference for the Sliced Wasserstein distance--an easily computable variant of the Wasserstein distance. Specifically, we construct confidence intervals for the Sliced Wasserstein distanc…
Let L be a lattice in a connected Lie group. We show that besides a few exceptional cases, the deficiency of L is nonpositive.
The study shows subgroup separability conditions for specific groups.
problem Conditions for subgroup separability in free-by-cyclic and deficiency 1 groups.
method Analyzes polynomially growing monodromy and asymptotic probability of random groups.
result Random deficiency 1 groups are not subgroup separable with positive probability.
The study calculates the Smith-Thom deficiency of Hilbert squares and provides conditions for maximality.
problem Calculating the Smith-Thom deficiency of Hilbert squares and conditions for maximality.
method Using Mayer-Vietoris mapping and rank calculations.
result Established necessary and sufficient conditions for maximality of Hilbert squares in projective complete intersections.
Contextual bandit methods fail with deficient support data.
problem Learning from support-deficient data in contextual bandits.
method Three approaches to IPS-based learning: action space restriction, reward extrapolation, and policy space restriction.
result Systematic analysis and empirical evaluation of approaches to IPS-based learning.
Classifiers trained on data sets possessing an imbalanced class distribution are known to exhibit poor generalisation performance. This is known as the imbalanced learning problem. The problem becomes particularly acute when we consider incremental classifiers operating on imbalanced data streams, especially when the l…
A new framework for robust transfer learning that avoids negative transfer in domains with unequal information.
problem Negative transfer in unsupervised domain adaptation, especially when source and target domains have different levels of informativeness.
method Decision-theoretic framework based on Le Cam's theory of statistical experiments, using constructive approximations to replace strict invariance with directional simulability.
result Le Cam Distortion achieves near-perfect frequency estimation and zero source utility loss in various domains, demonstrating superior performance compared to traditional methods.
The paper addresses flaws in fixed point assertions for digital images.
problem Deficiencies in previously published works on fixed point assertions for digital images.
method Continues a series of studies to identify and rectify issues in fixed point assertions.
result Identifies and corrects flaws in fixed point assertions for digital images.
This paper improves normalizing flows by combining MLE and sliced-Wasserstein distance for better data fidelity.
problem Normalizing flows struggle with generating realistic data and detecting out-of-distribution data.
method Proposes a hybrid objective function combining MLE and sliced-Wasserstein distance.
result Shows better generative abilities and lower likelihood of out-of-distribution data.
The paper calculates the number of oriented rational links with a given deficiency.
problem Counting oriented rational links with a specific deficiency.
method Derived precise formulas for the number of oriented rational links with crossing number n and deficiency d.
result Precise formulas for the number of oriented rational links with crossing number n and deficiency d.
Analyzes the structure and rank of neural network Hessians.
problem Understanding redundancy in overparameterized neural networks.
method Theoretical tools to analyze Hessian map range and rank deficiency.
result Exact formulas and tight upper bounds for Hessian rank of deep linear networks.
The goal of transfer learning is to improve the performance of target learning task by leveraging information (or transferring knowledge) from other related tasks. In this paper, we examine the problem of transfer distance metric learning (DML), which usually aims to mitigate the label information deficiency issue in t…
We examine certain symmetries in the deficiencies of a rational surgery on a knot in S3 by comparing the Spinc-structures on the rational surgery with those on a related integral surgery. We then provide an application of these symmetries in the form of a theorem that obstructs Dehn surgeries in S3. Thi…
Specialists tolerate defects to gain flexibility, which can be removed when needed.
problem The economic benefits and limitations of deliberately tolerating defects in decision-making.
method Analyzes the conditions under which defects can be kept and removed, using economic models and structural analysis.
result A defect is profitably removable if certain conditions are met, and the premium is the support function of the class's ROC set.
Specialists tolerate defects to gain flexibility, which can be removed when needed.
problem The economic benefits and limits of deliberately tolerating defects in decision-making.
method Analyzes the economic position of keeping and removing defects, using a coupling lemma and structural economic models.
result A defect is profitably removable if the detector-relevant distinction survives a restriction and the advantage condition holds.
Study uses DHS to classify anemia types using CBC indices.
problem Anemia classification for medical purposes.
method Dynamic Harmony Search (DHS) applied to CBC indices.
result DHS outperforms other models in anemia classification.
Proves one-relator groups are fundamental groups of Sasakian manifolds.
problem Characterizing groups that can be fundamental groups of Sasakian manifolds.
method Analyzes one-relator groups and classifies groups of deficiency at least two.
result Proves sufficient and necessary conditions for one-relator groups to be fundamental groups of Sasakian manifolds.
"Deep Learning" methods attempt to learn generic features in an unsupervised fashion from a large unlabelled data set. These generic features should perform as well as the best hand crafted features for any learning problem that makes use of this data. We provide a definition of generic features, characterize when it i…
A new algorithm solves constrained optimization problems with stochastic gradients.
problem Nonlinear equality constrained optimization with rank-deficient Jacobians.
method Step decomposition strategy combining normal and tangential steps.
result Convergence guarantees in rank-deficient Jacobian cases.
Generative models assess quality on time-series data using ITS and FITD.
problem Lack of consensus for quality assessment of class-conditional generative models on time-series data.
method Introduced InceptionTime Score (ITS) and Frechet InceptionTime Distance (FITD) to evaluate generative models.
result ITS and FITD combined with TSTR can accurately assess generative model performance on time-series data.
For every N > 0 there exists a group of deficiency less than -N that arises as the fundamental group of a smooth homology 4-sphere and also as the fundamental group of the complement of a compact contractible submanifold of the 4-sphere. A group is the fundamental group of the complement of a contractible submanifold o…
We address two fundamental and well-known problems of Gromov and Lyndon: \demo{Problem A} (Gromov, see [5]). Consider a category Mn of closed manifolds of dimension n with nonzero-degree ways as morphisms. Study a partial order M≥N⇔Mor(M,N)=φ. For which N the degrees of maps $f: M \t…
A new method combines online and offline learning to tackle contextual bandits with missing action support.
problem Learning optimal policies with logged data when the logging policy has deficient support.
method Hybrid approach using online exploration to exploit supported actions and offline learning to avoid unnecessary explorations.
result Determines an optimal policy with theoretical guarantees using minimal online explorations.
We study "how far away" a finite index subgroup G of SL(2,Z) is from being a congruence group. For this we define its deficiency of being a congruence group. We show that the index of the image of G in SL(2,Z/nZ) is biggest, if n is the general Wohlfahrt level. We furthermore show that the Veech groups of origamis (or …
Magnetoencephalography and electroencephalography (M/EEG) can reveal neuronal dynamics non-invasively in real-time and are therefore appreciated methods in medicine and neuroscience. Recent advances in modeling brain-behavior relationships have highlighted the effectiveness of Riemannian geometry for summarizing the sp…
Bayesian model predicts iron deficiency from multi-source multi-way molecular data.
problem Predicting iron deficiency in rhesus monkeys from multi-source multi-way molecular data.
method Developed a Bayesian approach with a linear model incorporating multi-way dependence and varying signal sizes across sources.
result Model accurately classifies iron deficiency in monkeys and outperforms simpler models.
Geometric families of low-rank covariances improve flexibility and tractability in high dimensions.
problem Interpolating and identifying covariance matrices in high dimensions with limited data.
method Differential geometric construction of low-rank covariance families, interpolation on manifolds, and distance minimization for identification.
result Differential geometric covariance families offer significant flexibility and computational tractability.
Meta-learned confidence improves few-shot learning accuracy.
problem Improving accuracy in few-shot learning with unreliable model confidence.
method Meta-learning confidence weights for query samples to improve transductive inference performance.
result Meta-learned confidence leads to new state-of-the-art results on benchmark datasets.
Improved risk-sensitive RL with exponential Bellman equation and better regret bounds.
problem Exponential gap between upper and lower bounds in risk-sensitive RL.
method Identified and addressed deficiencies in existing algorithms and analysis; developed novel analysis and exploration mechanism.
result Improved regret upper bounds over existing ones.
We consider options that pay the complexity deficiency of a sequence of up and down ticks of a stock upon exercise. We study the price of European and American versions of this option numerically for automatic complexity, and theoretically for Kolmogorov complexity. We also consider run complexity, which is a restricte…
Paper addresses OPE for dependent bandit samples using MDS and batch updates.
problem Evaluating policies from non-i.i.d. historical data in contextual bandits.
method Constructs an MDS-based estimator for dependent samples, solves batch update and deficient support issues.
result Derives an asymptotically normal estimator for evaluation policy value.
We prove that every finitely presented group with positive first ℓ2-Betti number that virtually surjects onto Z is acylindrically hyperbolic. In particular, this implies acylindrical hyperbolicity of finitely presented residually finite groups with positive first ℓ2-Betti number as well as groups …
New method identifies causal direction with latent confounders.
problem Identifying causal direction in presence of multiple latent variables.
method Use of joint higher-order cumulant matrix properties.
result Causal asymmetry can be seen from rank deficiency properties of cumulant matrices.
Study finds LLMs hallucinate in finance tasks, needing research.
problem Hallucination in LLMs in finance.
method Empirical investigation of four methods to mitigate hallucination.
result LLMs hallucinate in financial tasks.
We compute the characteristic varieties and the Alexander polynomial of a finitely generated nilpotent group. We show that the first characteristic variety may be used to detect nilpotence. We use the Alexander polynomial to deduce that the only torsion-free, finitely generated nilpotent groups with positive deficiency…
The study connects knot crossing numbers to surface properties and tunnel numbers.
problem Understanding the relationship between knot crossing numbers and surface properties.
method Combines surface ascending-number estimates, bridge-number estimates, and amalgamation arguments for Heegaard splittings.
result Establishes a linear relationship between the crossing number and the Heegaard deficiency of the surface.
Lower bounds show many sampling algorithms need many gradient queries.
problem Sampling from strongly log-concave densities in high dimensions.
method Information theory and stochastic gradient methods.
result Lower bound on number of gradient queries needed.
Gradient descent with preconditioning finds global optima in overparameterized nonconvex factorization.
problem Finding global optima in nonconvex Burer-Monteiro factorization.
method Preconditioned gradient descent for overparameterized nonconvex function minimization.
result Gradient descent with preconditioning achieves linear convergence in the overparameterized case.
Feature noise causes loss discrepancies across groups even with equal data.
problem Loss discrepancies observed in learning procedures across different groups.
method Characterized the effect of feature noise on loss discrepancy in linear regression.
result Feature noise leads to loss discrepancy even when groups have equal data.
Proposes MLCNN for better multivariate time series forecasting.
problem Challenges in forecasting multivariate time series, especially the limitation of predicting only one future moment.
method MLCNN, a multi-task deep learning framework inspired by Construal Level Theory, fuses future visions of near and distant future predictions.
result Significant improvements in forecasting accuracy (4.59% RMSE reduction, 6.87% MAE reduction) on real-world datasets.
New method differentiates square-root Kalman filters robustly.
problem Gradient calculation issues in square-root Kalman filters.
method Closed-form chain rule derived from Gramian identity, resolves non-orthogonal and rank-deficient issues.
result Robust automatic differentiation for Kalman filters, resolving numerical stability and gradient issues.
We show that if π is the fundamental group of a 4-dimensional infrasolvmanifold then −2≤def(π)≤0, and give examples realizing each of these values. We also determine the abstract commensurators of such groups. Finally we show that if G is a finitely generated group the kernel of the natural homomorphism f…
We study the interplay among Wall's D(2) problem, normal generation conjecture (the Wiegold Conjecture) of perfect groups and Swan's problem on partial Euler characteristic and deficiency of groups. In particular, for a 3-dimensional complex X of cohomological dimension 2 with a finite fundamental group, assuming t…
The paper discusses fairness in bank stress tests, comparing various methods to address institutional differences.
problem Fair aggregation of bank-specific stress test models into a common model.
method Comparing various notions of regression fairness, including estimating and discarding centered bank fixed effects.
result The method of estimating and discarding centered bank fixed effects is preferable for linear models, improving forecast accuracy and equal treatment.
Regular integer lattices are characterized by k unit vectors that build up their generator matrices. These have rank k for D-lattices, and are rank-deficient for A-lattices, for E_6 and E_7. We count lattice points inside hypercubes centered at the origin for all three types, as if classified by maximum infinity norm i…
The paper analyzes a five-factor capital market model and facilitates exact simulation.
problem Analyzing and simulating a five-factor capital market model.
method Using a Vasicek interest rate model, mean-reverting excess return, and realized inflation with expectation, the paper derives the necessary distributional results and describes practical methods to overcome rank deficiency.
result Exact simulation from the model can be achieved by sampling from a seven-dimensional normal distribution.