Visual spoofing bypasses spam filters and plagiarism detection.
problem Vulnerability in spam filters that can be exploited by visually similar but differently encoded characters.
method Replaces characters with visually similar but differently encoded characters from a different alphabet.
result Spammers can create messages that bypass existing spam filters.
Two neural network methods approximate conditional optimal transport for Bayesian inference.
problem Approximating conditional optimal transport for Bayesian inference in high dimensions.
method Neural network approximations of conditional optimal transport maps.
result Improved scalability and modeling choices for conditional sampling and density estimation.
Q-SAVI model improves drug discovery accuracy with prior knowledge of chemical space.
problem Challenges in drug discovery due to covariate shift and limited labeled data.
method Probabilistic model with domain-informed prior distributions over functions.
result Q-SAVI outperforms state-of-the-art techniques in predictive accuracy and calibration.
Policy gradient methods are widely used for control in reinforcement learning, particularly for the continuous action setting. There have been a host of theoretically sound algorithms proposed for the on-policy setting, due to the existence of the policy gradient theorem which provides a simplified form for the gradien…
Paper argues context equals environment, improving AI generalization.
problem AI models struggle to generalize in new environments.
method In-Context Risk Minimization (ICRM) algorithm.
result ICRM leads to significant out-of-distribution performance improvements.
Machine learning can improve 2SLS first stage predictions, but nonlinear methods often introduce bias.
problem Improving the first stage of 2SLS using machine learning.
method Decomposed bias into three components, investigated through simulation.
result Nonlinear machine learning methods can introduce substantial bias in second-stage estimates.
New method predicts quasar continuum near Lyman-α with high precision and accuracy.
problem Precise measurement of quasar red damping wing for epoch of reionization.
method Fully probabilistic approach using conditional neural spline flows.
result Achieved state-of-the-art precision and accuracy in predicting quasar continua.
Bidirectional attention is shown to be equivalent to a continuous bag of words model with mixture-of-experts.
problem Understanding the statistical underpinnings of bidirectional attention.
method Exploring bidirectional attention as a mixture-of-experts model and reparameterizing it.
result Bidirectional attention can be viewed as a continuous bag of words model with mixture-of-experts weights.
PPBoot simplifies prediction-powered inference.
problem Prediction-powered inference problems.
method Bootstrap-based method for arbitrary estimation problems.
result PPBoot often performs nearly identically to PPI(++).
Unified framework for MCMC and machine learning problems.
problem Intersection of MCMC and machine learning problems.
method Unified framework integrating various MCMC and machine learning techniques.
result Translation and generalization of theory and methods.
Instanton Floer homology matches Heegaard Floer for almost-rational plumbings.
problem Matching instanton Floer homology with Heegaard Floer for specific 3-manifolds.
method Utilizes lattice homology and a recent cobordism map decomposition theorem.
result Isomorphism between framed instanton Floer homology and Heegaard Floer for almost-rational plumbings.
The paper improves confidence set construction for statistical inference.
problem Constructing reliable confidence sets in statistical inference.
method Establishes a finite-sample bound using effective dimension and generalized self-concordance.
result Developed a confidence set adapted to optimization landscapes.
Koopman operator theory simplifies complex systems analysis.
problem Analyzing nonlinear dynamical systems and complex networks.
method Estimating Koopman operator from data to reveal system properties.
result Koopman operators provide insights into system characteristics.
New findings show strategic interactions can undermine model expressiveness in machine learning.
problem How strategic interactions affect model performance in machine learning.
method Analyzing model expressiveness and strategic interactions in various machine learning settings.
result Optimizing over less expressive model classes can lead to better equilibrium outcomes in strategic environments.
New framework for learning KR maps from data, ensuring stable generalization.
problem Learning monotone triangular transport maps efficiently and accurately.
method General framework using invertible transformations of smooth functions, ensuring no spurious local minima.
result Unique global minimizer corresponds to the KR map under certain conditions.
Deep generative model for healthcare data identifies coherent substructures and mutational clusters.
problem Analytical challenges in healthcare data, including sparsity, missingness, and small sample sizes.
method Proposes a deep generative Bayesian model with collapsed Gibbs sampling for multinomial count data.
result Identifies coherent substructures and biologically meaningful mutational clusters in cancer data.
We extend a variational framework to estimate calibration errors for Lp divergences.
problem Ensuring predicted probabilities match observed class frequencies in machine learning.
method Extend variational framework to Lp divergences, separating over- and under-confidence. result Avoids overestimation and separates over- and under-confidence.
Collab algorithm learns models from agents with missing data.
problem Learning linear models collaboratively with missing data.
method Distributed, semi-supervised algorithm with three steps: local training, aggregation, and distribution.
result Collab achieves nearly asymptotically local minimax optimal performance.
A new calibration metric bridges testability and actionability.
problem Combining testability and actionable insights for forecast probabilities.
method Cutoff Calibration Error (CCE) that assesses calibration over intervals of forecasted probabilities.
result Cutoff Calibration Error is both testable and actionable.
New active learning framework for multiclass classification beyond realizability assumption.
problem Active learning in non-realizable settings with convex model classes.
method Surrogate risk minimization, epoch-based fitting, aggregation of models.
result Achieves label and sample complexity comparable to prior work in non-realizable settings.
IMP finds sparse subnetworks that match full networks, revealing geometric insights.
problem Finding sparse subnetworks that match full, overparameterized networks.
method Iterative magnitude pruning (IMP) algorithm, analyzing error landscape geometry.
result IMP masks found at end of training convey useful information for rewound networks.
Given a pointed 4-ended tangle T⊂D3, there are two Khovanov theoretic tangle invariants, $\unicode{1044}_1(T)$ from [arXiv:1910.1458] and LT from [arXiv:1808.06957], which are twisted complexes over the Fukaya category of the boundary 4-punctured sphere (S2,4pt)=∂(D3,T). We prove that …
Untuned SGD converges but with an exponential dependence on smoothness, adaptive methods prevent this.
problem The exponential dependence on smoothness in untuned SGD's convergence rate.
method Untuned SGD with arbitrary stepsize η, adaptive methods like NSGD, AMSGrad, and AdaGrad.
result Adaptive methods prevent the exponential dependence on smoothness in SGD.
Deep neural networks classify unbounded Gaussian mixture data without dimensionality issues.
problem Binary classification of unbounded Gaussian mixture data.
method Deep ReLU neural networks with non-asymptotic upper bounds and convergence rates.
result Deep ReLU networks can classify unbounded Gaussian mixture data without dimensionality constraints.
For mobile robots to operate autonomously in general environments, perception is required in the form of a dense metric map. For this purpose, we present the stochastic triangular mesh (STM) mapping technique: a 2.5-D representation of the surface of the environment using a continuous mesh of triangular surface element…
LLMs perform well in financial sentiment analysis without fine-tuning.
problem Challenges in financial terminology, emotions, and ambiguous expressions.
method In-context learning methods for financial document-sentiment pairs.
result LLMs can generalize in-context demonstrations to new financial documents.
A new formula approximates knot volume using Jones polynomial evaluations.
problem Approximating the hyperbolic volume of knots using a simple formula.
method Reversing a neural network trained on Jones polynomial evaluations.
result Average error of 2.86% on first 1.7 million knots.
Spin networks boost quantum algorithms solving SU(2) symmetric problems.
problem Efficiently solving SU(2) symmetric problems on quantum hardware.
method Using SU(2) equivariant variational quantum circuits based on spin networks.
result Spin networks provide a direct implementation for SU(2) equivariant quantum circuits.
Study one-shot strategic classification under unknown costs, improving worst-case accuracy.
problem Learning robust decision rules in strategic settings with unknown user costs.
method Formal study of one-shot strategic classification, framing as a minimax problem, designing efficient algorithms for full-batch and stochastic settings.
result Proves efficient algorithms converge to minimax solution, revealing dual norm regularization's value.
New method allows sheets to morph into multiple shapes via spatially varying stimuli.
problem Limitation of current shape-programmed sheets to achieve only one target geometry.
method Patterning the stimulus itself for spatiotemporal control over local deformation magnitudes.
result A single physical sample can be induced to traverse a continuous family of target geometries.
The paper connects counterfactual fairness to robust prediction and group fairness using causal context.
problem The challenge of ensuring fairness in AI systems when counterfactuals cannot be directly observed.
method Using causal context to bridge counterfactual fairness, robust prediction, and group fairness.
result Counterfactual fairness is equivalent to group fairness metrics in specific contexts.
Lottery tickets find good initializations for IMP with sparse training.
problem Finding good initializations for iterative magnitude pruning (IMP) in sparse networks.
method Empirical study of IMP performance with varying pre-training data and iterations.
result Training on a small fraction of data suffices to obtain good initializations for IMP.
System uses conformal prediction to help experts make accurate decisions without understanding when to trust it.
problem Helping experts make accurate decisions in multiclass classification tasks.
method Develops an automated decision support system using conformal prediction to provide precise prediction sets and an efficient search method.
result System improves expert predictions by providing precise prediction sets and forcing experts to predict from these sets.
Study toric gravitational instantons using rod structures and inequalities.
problem Classify toric ALE/ALF instantons.
method Express signature in terms of rod structure, apply Hitchin-Thorpe inequalities, analyze rod structures with three turning points.
result Necessary conditions for rod structures of toric ALE/ALF instantons.
Enhances molecular design models by fine-tuning uncertainty-guided VAEs.
problem Fine-tuning pre-trained generative models for specific molecular property optimization.
method Uncertainty-guided fine-tuning of variational autoencoders in an active learning setting.
result Uncertainty-guided fine-tuning improves model performance across multiple molecular properties.
This study analyzes why attention layers in neural networks can cause signal loss and proposes a solution.
problem Pathological behavior of attention layers in neural networks, leading to signal loss.
method Spectral analysis using Random Matrix Theory to identify and mitigate rank collapse in width.
result A novel solution to mitigate rank collapse in width by removing outlier eigenvalues.
We develop efficient and sharp bounds on policy value under perturbations in MDPs.
problem Evaluating policies under best- and worst-case perturbations in MDPs with transition observations.
method Proposed a perturbation model for MDPs, developed semiparametrically efficient estimator with asymptotic normality.
result Semiparametrically efficient and asymptotically normal estimator for policy value bounds.
New risk measures for incomplete markets without lattice structures.
problem Risk measures on incomplete markets without lattice structures.
method Study of risk measures without lattice structures, focusing on tractable dual representations and solid superspaces.
result Existence of a tractable dual representation equivalent to a Fatou-like property, and extension theorems under certain conditions.
New method estimates shape distance in neural representations with limited data.
problem Measuring geometric similarity between high-dimensional network representations.
method Method-of-moments estimator with tunable bias-variance tradeoff.
result New estimator achieves lower bias than standard methods in high-dimensional settings.
Constructs local superconformal algebras on supermanifolds.
problem Deformations of odd distributions on supermanifolds.
method Local super dg Lie algebra construction.
result Returns conformal supergravity multiplet in various dimensions.
Introduces Star-Shaped DDPMs for non-Gaussian distributions.
problem Difficulties in defining DDPMs for non-Gaussian distributions.
method Star-shaped diffusion process, duality with specific Markovian diffusions, efficient algorithms.
result SS-DDPMs can model distributions like Beta, von Mises-Fisher, Dirichlet, Wishart.
Active inference uses machine learning to prioritize data labeling for more efficient statistical inference.
problem Efficiently collecting data points for statistical inference with limited labels.
method A machine learning-assisted approach that identifies uncertain data points for labeling.
result Achieves the same level of accuracy with fewer samples, resulting in smaller confidence intervals and more powerful p-values.
Stochastic encoders outperform deterministic ones in 'perfect perceptual quality'.
problem Understanding when stochastic encoders outperform deterministic ones.
method Provided a toy example to illustrate performance.
result Stochastic encoders can significantly outperform deterministic ones in 'perfect perceptual quality'.
BiPE blends intra-segment and inter-segment encodings for better length extrapolation.
problem Improving length extrapolation in language models.
method Bilevel Positional Encoding (BiPE) that separates intra-segment and inter-segment encodings.
result BiPE enhances length extrapolation across various text modalities.
Enhanced Bayesian target encoding uses sampling techniques to improve model performance.
problem Improving target encoding for better model performance in machine learning.
method Using sampling techniques in Bayesian target encoding to extract intra-category distribution information.
result Improves generalization and reduces target leakage in machine learning models.
Paper proposes LCP for structural encodings, outperforming existing methods.
problem Improving Graph Neural Networks performance through effective structural encodings.
method Geometric perspective, Local Curvature Profiles (LCP) for structural encodings, combining with global positional encodings, comparing with rewiring techniques.
result LCP significantly outperforms existing structural encodings and combining LCP with global positional encodings improves performance.
New definition reveals encoding explanations that retain predictive power.
problem Challenges in evaluating and identifying encoding explanations.
method Developed a definition of encoding based on conditional dependence.
result Existing evaluation scores do not rank non-encoding explanations correctly, but STRIPE-X does.
Study on encoding neural architectures for NAS, showing impact on performance.
problem Impact of different encodings on NAS performance.
method Formal definition and characterization of encodings, empirical study of encodings' effectiveness.
result Different encodings can significantly affect NAS performance.