Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

15314661 · Feb 202019922001200920172026
48 results for continuous-domain CNN

This research studies affine invariance in continuous-domain convolutional neural networks.

problem Recognizing patterns and features under affine transformations in continuous domains.
method Introduces a new criterion for assessing affine invariance, embeds images into the affine Lie group, and analyzes convolution over this group.
result Extends the scope of geometrical transformations that deep-learning pipelines can handle.

CoDAG combines domain adaptation and generalization for unsupervised continual domain shift learning.

problem Acquiring knowledge in unsupervised continual domain shift learning.
method Complementary Domain Adaptation and Generalization (CoDAG) framework.
result CoDAG outperforms state-of-the-art models in all datasets and evaluation metrics.

Parallelizes MCTS for continuous domains using leaf and root parallelization.

problem Solving challenging tasks in continuous domains using MCTS.
method Extends existing parallelization strategies to continuous domains, focusing on leaf and root parallelization.
result Proposes two final selection strategies for continuous states in root parallelization.

This paper tackles continuous domain adaptation with a new approach.

problem Learning in non-stationary environments, especially domain drift.
method Variational domain-agnostic feature replay, composed of inference, generative, and solver modules.
result Demonstrates the effectiveness of the proposed approach for practical usage.

Paper extends sparse alternatives to softmax for continuous domains, enabling efficient attention mechanisms.

problem Efficiently assigning zero probability to irrelevant categories in continuous domains.
method Extend alpha-entmax to continuous domains, introducing continuous-domain attention mechanisms.
result Continuous attention allows attending to time intervals and compact regions, improving text classification, machine translation, and visual question answering.

This tutorial introduces the CMA Evolution Strategy (ES), where CMA stands for Covariance Matrix Adaptation. The CMA-ES is a stochastic, or randomized, method for real-parameter (continuous domain) optimization of non-linear, non-convex functions. We try to motivate and derive the algorithm from intuitive concepts and …

2016-04-04abs ↗pdf ↗

Ada-BKB optimizes black-box functions on continuous domains with adaptive discretization.

problem Optimizing functions with continuous domains using Gaussian process optimization.
method Adaptive discretization of the function domain to avoid non-convex optimization costs.
result Ada-BKB algorithm runs in O(T2dexteff2)O(T^2 d_ ext{eff}^2), significantly faster than existing methods.

Paper tackles sim-to-real transfer in continuous domains with partial observations.

problem Lack of theoretical foundation for sim-to-real transfer in continuous domains with partial observations.
method Developed a new algorithm for infinite-horizon average-cost LQGs and established a regret bound.
result A popular robust adversarial training algorithm can learn competitive policies from simulation to real-world environments.

This paper tackles continuous domain generalization, improving model performance across unseen domains.

problem Existing domain generalization approaches fail to capture the complex, multidimensional nature of real-world variation.
method Introduces Continuous Domain Generalization (CDG), a principled framework grounded in geometric and algebraic theories. Proposes a Neural Lie Transport Operator (NeuralLio) for structure-preserving parameter transitions and a gating mechanism for robust generalization.
result Demonstrates significant improvement in generalization accuracy and robustness across various datasets.

This primer explains diffusion models in general state spaces.

problem Diffusion models in general state spaces are not well-introduced.
method Develops discrete-time and continuous-time views of diffusion models, deriving Fokker-Planck and master equations.
result Unified understanding of diffusion models across continuous and discrete domains.

Paper improves neural network robustness certification with tighter radii estimates.

problem Certifying neural networks' robustness against adversarial attacks.
method Advanced algorithms for discrete and continuous domains, optimizing sample size, standard deviation, and temperature.
result Significant improvement in certified test-set accuracy with tighter certified radii bounds.

VCoTTA uses variational Bayesian methods to adapt models under continuous domain shifts.

problem Error accumulation in continual test-time adaptation.
method VCoTTA employs variational Bayesian techniques to update a Bayesian Neural Network (BNN) during testing, combining priors from source and teacher models.
result VCoTTA effectively mitigates error accumulation in CTTA, as shown by experimental results on three datasets.

Determinantal point processes (DPPs) are point process models that naturally encode diversity between the points of a given realization, through a positive definite kernel KK. DPPs possess desirable properties, such as exact sampling or analyticity of the moments, but learning the parameters of kernel KK through like…

2015-07-04abs ↗pdf ↗

In many applications, data is collected in batches, some of which are corrupt or even adversarial. Recent work derived optimal robust algorithms for estimating discrete distributions in this setting. We consider a general framework of robust learning from batches, and determine the limits of both classification and dis…

2020-02-25abs ↗pdf ↗

DDN models flexible free-form conditional distributions.

problem Difficulty in explicitly approximating arbitrary conditional distributions.
method Deconvolutional neural network framework for discretizing continuous domains.
result DDN outperforms other density-estimation methods on various tasks.

In recent years, deep learning poses a deep technical revolution in almost every field and attracts great attentions from industry and academia. Especially, the convolutional neural network (CNN), one representative model of deep learning, achieves great successes in computer vision and natural language processing. How…

2018-06-12abs ↗pdf ↗

We attempt to interpret how adversarially trained convolutional neural networks (AT-CNNs) recognize objects. We design systematic approaches to interpret AT-CNNs in both qualitative and quantitative ways and compare them with normally trained models. Surprisingly, we find that adversarial training alleviates the textur…

2019-05-23abs ↗pdf ↗

It is known that evolution strategies in continuous domains might not converge in the presence of noise. It is also known that, under mild assumptions, and using an increasing number of resamplings, one can mitigate the effect of additive noise and recover convergence. We show new sufficient conditions for the converge…

2014-04-09abs ↗pdf ↗

State-of-the-art image recognition systems use sophisticated Convolutional Neural Networks (CNNs) that are designed and trained to identify numerous object classes. Such networks are fairly resource intensive to compute, prohibiting their deployment on resource-constrained embedded platforms. On one hand, the ability t…

2018-12-16abs ↗pdf ↗

In recent years, Convolutional Neural Network (CNN) based methods have achieved great success in a large number of applications and have been among the most powerful and widely used techniques in computer vision. However, CNN-based methods are computational-intensive and resource-consuming, and thus are hard to be inte…

2019-11-15abs ↗pdf ↗

Improved robustness of 1D CNNs for heart arrhythmia classification.

problem Improving the robustness of 1D CNNs for classification tasks.
method Parameterization using Cayley transform and controllability Gramian for Lipschitz-bounded CNNs.
result Improved robustness of trained Lipschitz-bounded 1D CNNs for heart arrhythmia classification.

This paper tackles convex-submodular minimax problems in mixed continuous-discrete domains.

problem Convex-submodular minimax problems in mixed continuous-discrete domains.
method Introduces new notions of optimality and proposes iterative algorithms combining discrete and continuous optimization.
result Characterizes convergence rates, computational complexity, and quality of solutions for convex and monotone-submodular minimax problems.

Inverse optimal control, also known as inverse reinforcement learning, is the problem of recovering an unknown reward function in a Markov decision process from expert demonstrations of the optimal policy. We introduce a probabilistic inverse optimal control algorithm that scales gracefully with task dimensionality, an…

2012-06-18abs ↗pdf ↗

This paper proposes a generic method to learn interpretable convolutional filters in a deep convolutional neural network (CNN) for object classification, where each interpretable filter encodes features of a specific object part. Our method does not require additional annotations of object parts or textures for supervi…

2019-01-08abs ↗pdf ↗