Adaptive algorithm generates unrestricted adversarial inputs, defeating robust classifiers.
problem Vulnerability of neural networks to unrestricted adversarial inputs.
method Adaptive algorithm for generating unrestricted adversarial inputs.
result Adversarial inputs defeat robust classifiers.
Adversarial examples are typically constructed by perturbing an existing data point within a small matrix norm, and current defense methods are focused on guarding against this type of attack. In this paper, we propose unrestricted adversarial examples, a new threat model where the attackers are not restricted to small…
New method generates unrestricted adversarial face images to bypass robust face recognition systems.
problem Vulnerability of face recognition systems to unrestricted adversarial examples.
method Image translation techniques to generate large perturbations in face images.
result Achieved high attack success rates (90% and 80%) under white- and black-box settings. Generative models create indistinguishable adversarial objects for object detection.
problem Creating unrestricted adversarial examples for object detection.
method Search over latent space of GAN for adversarial objects.
result Generated adversarial objects are indistinguishable from non-adversarial objects and transferable.
ScoreAG generates unrestricted adversarial images maintaining semantic integrity.
problem Limited robustness evaluations due to ℓp-norm constraints. method Score-Based Adversarial Generation (ScoreAG) using score-based generative models.
result ScoreAG improves robustness assessments across multiple benchmarks.
Proposes a new method to generate unrestricted adversarial examples.
problem Generating unrestricted adversarial examples without norm constraints.
method Leveraging state-of-the-art generative models to manipulate image fine-grained aspects.
result Our adversarial images look indistinguishable from natural images and can bypass certified defenses.
New algorithms ensure fair selection in combinatorial semi-bandit with unrestricted delays.
problem Fair selection in stochastic combinatorial semi-bandit with delayed feedback.
method Introduced merit-based fairness constraints and new bandit algorithms for reward and fairness.
result Achieved sublinear expected reward and fairness regrets with dependence on delay distribution quantiles.
We study learning problems involving arbitrary classes of functions F, distributions X and targets Y. Because proper learning procedures, i.e., procedures that are only allowed to select functions in F, tend to perform poorly unless the problem satisfies some additional structural property (e.g., that F is co…
Study of unrestricted virtual braid groups and their properties.
problem Characterize and describe homomorphisms of unrestricted virtual braid groups.
method Analyzing homomorphisms to symmetric groups and finite groups, characterizing images, proving characteristic subgroups, determining automorphism groups, and studying residual properties.
result Complete description of homomorphisms from UVBn to Sn for n≥5. We consider the group of unrestricted virtual braids, describe its structure and explore its relations with fused links. Also, we define the groups of flat virtual braids and virtual Gauss braids and study some of their properties, in particular their linearity.
This paper considers the optimal dividend payment problem in piecewise-deterministic compound Poisson risk models. The objective is to maximize the expected discounted dividend payout up to the time of ruin. We provide a comparative study in this general framework of both restricted and unrestricted payment schemes, wh…
This paper proposes BAT to balance accuracy and robustness in adversarial training.
problem Balancing accuracy and robustness in adversarial training models.
method Blind adversarial training (BAT) uses a cutoff-scale strategy to adaptively estimate a nonuniform budget for AEs.
result BAT improves the overall robustness of adversarial training models.
New methods reduce extrapolation errors in feature importance.
problem Flawed feature importance methods using unrestricted permutations lead to extrapolation errors.
method Three new approaches: conditional model reliance, Knockoffs with Gaussian transformation, and restricted ALE plot designs.
result Theoretical and numerical results show our strategies reduce/eliminate extrapolation.
MoMA improves model-based RL by using unrestricted policy classes.
problem Limited sample efficiency and generalizability in model-based offline RL.
method Model-based mirror ascent algorithm with general function approximations.
result Theoretical guarantees and practical implementation of MoMA.
Study compares adaptive vs fixed query learning methods.
problem Comparing adaptive and fixed query learning methods for task approximation.
method Examined in-context and agentic learning in two settings: unrestricted and realizable.
result Adaptivity does not hinder performance in unrestricted setting but can in realizable setting.
R. Kashaev and N. Reshetikhin introduced the notion of holonomy braiding extending V. Turaev's homotopy braiding to describe the behavior of cyclic representations of the unrestricted quantum group Uqsl2 at root of unity. In this paper, using quandles and biquandles we develop a general theory for Reshetikhin-Turae…
New findings on GRW space-times with constant scalar curvature.
problem Understanding GRW space-times in different subspaces.
method Analyzing orthogonal subspaces of Gray's decomposition.
result Generalized quasi-Einstein GRW space-times reduce to known types of space-times.
New method optimizes policies without assuming known link functions between preferences and rewards.
problem Policy alignment with unknown and unrestricted link functions.
method Formulates an f-divergence-constrained reward maximization problem, learning policies directly. result Induces a semiparametric single-index binary choice model for policy alignment.
The rebmix package provides R functions for random univariate and multivariate finite mixture model generation, estimation, clustering and classification. The paper is focused on multivariate normal mixture models with unrestricted variance-covariance matrices. The objective is to show how to generate datasets for a kn…
New optimal surfaces found in Heisenberg group defy Euclidean sphere optimality.
problem Optimizing mean curvature in Heisenberg group sub-Riemannian setting.
method Developed variational theory, established first and second variation formulas, introduced new critical surfaces.
result Identified and characterized a new family of rotationally invariant critical surfaces, the Pansu-Minkowski spheres.
A stochastic model helps maintain insufficiently funded pension funds.
problem Maintaining pension funds that are underfunded and require external financing.
method A time-homogeneous diffusion process with a barrier is used to model the unrestricted reserves value, and a renewal-reward process models the financing effort.
result Expected values and cost evaluations of maintenance are derived, and the approach is applied to a generalized Brownian motion process.
Study improves cryptocurrency price prediction using deep learning with trading and social media indicators.
problem Predicting price movements of cryptocurrencies using deep learning.
method Used deep learning algorithms (MLP, CNN, LSTM, ALSTM) on hourly and daily data of Bitcoin and Ethereum.
result Unrestricted model with trading and social media indicators outperforms restricted model.
The study extends classical results on harmonic functions to Riemannian manifolds with non-tangential boundary limits.
problem Extending classical results on harmonic functions to Riemannian manifolds with non-tangential boundary limits.
method Investigated the restricted mean-value property on Riemannian manifolds, focusing on non-tangential boundary behavior.
result Extended a classical result of Fenton to non-positively curved Harmonic manifolds of purely exponential volume growth.
The article has been withdrawn by the author. Wolfgang Lueck and Peter Linnell pointed out that the proof of Lemma 3.8 does not apply to the unrestricted case of wreath product. It is not clear at this stage how to complete the proof of Theorem 3.1 using the present version of Lemma 3.8. The valid results originating f…
Paper generates diverse, readable adversarial texts from scratch.
problem Text classification models are easily fooled by adversarial examples.
method Trained a conditional variational autoencoder (VAE) with adversarial loss and utilized GANs to generate consistent adversarial texts.
result Successfully generates adversarial texts with higher success rate and acceptable quality.
New method estimates sparse covariance matrices in logit mixtures.
problem Estimating correlations among random coefficients in logit models.
method Mixed-integer optimization (MIO) with Markov Chain Monte Carlo (MCMC) for posterior draws.
result Correctly recovers true covariance structure from synthetic data.
Defines a new 2+1-G-HQFT using graded skein modules.
problem Developing a new quantum field theory for groups.
method G-graded chromatic maps and skein modules.
result Recover modified Turaev-Viro invariants.
Polynomial-time DP algorithm for learning Gaussians with matching sample complexity.
problem Learning Gaussian distributions while maintaining privacy.
method General framework for reducing DP estimation to non-private, polynomial-time algorithm for Gaussian learning.
result Matching sample complexity to information-theoretic upper bound for Gaussian learning.
We consider an insurance entity endowed with an initial capital and a surplus process modelled as a Brownian motion with drift. It is assumed that the company seeks to maximise the cumulated value of expected discounted dividends, which are declared or paid in a foreign currency. The currency fluctuation is modelled as…
Algorithm tackles large-scale portfolio optimization with higher moments, improving computational efficiency.
problem Optimizing portfolios with higher moments (variance, skewness, kurtosis) for large asset universes is computationally infeasible.
method Developed a structure-exploiting algorithm based on Yau's affine-normal descent, working directly with return matrix.
result Algorithm avoids explicit higher-order tensors and exploits quartic structure for efficient computation.
A new way to describe correlation matrices makes modeling easier.
problem Describing correlation matrices in a flexible and positive-definite way.
method Introduces a novel parametrization that allows unrestricted vectors for correlation matrices.
result The new parametrization ensures positive definiteness without additional constraints.
Motivated by the resurgence of neural networks in being able to solve complex learning tasks we undertake a study of high depth networks using ReLU gates which implement the function x↦max{0,x}. We try to understand the role of depth in such neural networks by showing size lowerbounds against such network …
Deep NLP models benefit from underlying structures in the data---e.g., parse trees---typically extracted using off-the-shelf parsers. Recent attempts to jointly learn the latent structure encounter a tradeoff: either make factorization assumptions that limit expressiveness, or sacrifice end-to-end differentiability. Us…
Study on framed surfaces with bounds on Morse index.
problem Bounding Morse index for framed surfaces.
method Proved a linear bound on Morse index for framed surfaces.
result Proved a linear bound on Morse index by a linear function of genus, number of ends, and branch points.
We introduce a two-player contest for evaluating the safety and robustness of machine learning systems, with a large prize pool. Unlike most prior work in ML robustness, which studies norm-constrained adversaries, we shift our focus to unconstrained adversaries. Defenders submit machine learning models, and try to achi…
This paper tackles the computational complexity of finding approximate stationary points in non-convex optimization.
problem Finding approximate stationary points in non-convex optimization problems.
method PLS-completeness, zero-order algorithms, and gradient queries.
result The query complexity of finding approximate stationary points is Θ(1/ε) for d=2.
Advances geometric structure flows, proving short-time existence and uniqueness for various flows.
problem Analyzing flows of geometric structures, focusing on non-isometric flows and specific subgroups.
method Developed algebra and compared two flows: negative gradient and Ricci-harmonic. Proved existence and uniqueness for Ricci-harmonic flow.
result Proved short-time existence and uniqueness for Ricci-harmonic flow for arbitrary lower-order torsion-quadratic terms.
A promising class of generative models maps points from a simple distribution to a complex distribution through an invertible neural network. Likelihood-based training of these models requires restricting their architectures to allow cheap computation of Jacobian determinants. Alternatively, the Jacobian trace can be u…
New method for private density estimation of high-dimensional Gaussian mixtures.
problem Private density estimation for mixtures of unrestricted high-dimensional Gaussians.
method Exploits list global stability to prove upper bound on sample complexity.
result First upper bound on sample complexity for agnostic private density estimation.
The paper studies properties of stated SL(n)-skein algebras and their centers.
problem Properties of stated SL(n)-skein algebras and their centers.
method Quantum trace maps and embeddings into quantum tori.
result Finitely generation and PI-degrees of centers of stated SL(n)-skein algebras.
Estimates growth loss in fund models and proposes a shrinkage method.
problem Estimating growth loss in fund models under frequentist and Bayesian estimation.
method Proposes a shrinkage method to target maximal growth with minimal deviation.
result Empirical evidence shows shrinkage gives a stable estimate closer to growth potential.
Improved algorithm speeds up generation of universal adversarial perturbations.
problem Slow generation of universal adversarial perturbations.
method Optimized algorithm based on orientation of perturbation vectors.
result Significantly faster generation of universal perturbations with higher fooling rates.
This paper presents a new approach, called perturb-max, for high-dimensional statistical inference that is based on applying random perturbations followed by optimization. This framework injects randomness to maximum a-posteriori (MAP) predictors by randomly perturbing the potential function for the input. A classic re…
The paper tackles extrapolation of gene knockouts effects on RNA counts.
problem Modeling effects of gene knockouts on RNA counts for new perturbations.
method Formulated as a latent variable model with additive perturbation effects, proved identifiability, proposed PDAE for estimation.
result PDAE can accurately predict effects of unseen but identifiable perturbations.
Study shows transfer of adversarial robustness between different perturbation types is limited.
problem Understanding adversarial robustness across various perturbation types.
method Evaluated 32 attacks of 5 different types on models trained on a subset of ImageNet.
result Adversarial robustness transfer between perturbation types is limited and depends on the specific type of perturbation.
Novel geometry-informed irreversible perturbation accelerates Langevin dynamics convergence.
problem Accelerating convergence of Langevin dynamics for Bayesian computation.
method Geometry-informed irreversible perturbation of Riemannian manifold Langevin dynamics.
result Improves estimation performance over irreversible perturbations that ignore geometry.
Study linear perturbations in Schwarzschild black hole spacetime.
problem Linear perturbations of Schwarzschild black hole spacetime.
method Investigate linearised perturbation of constant mass aspect function foliation at null infinity.
result Linearised perturbations of Bondi energy and mass vanish, and all linear momentum can be achieved.
New research evaluates various perturbation methods for improving neural network robustness.
problem Understanding and improving robustness of Convolutional Neural Networks (CNNs) against adversarial attacks.
method Detailed evaluation of five main perturbation-based defenses, comparing random and deterministic approaches.
result Perturbation-based defenses are equivalent in efficacy, and attacks transfer between them.