The paper classifies Auerbach bases of lpn spaces.
problem Characterizing Auerbach bases in lpn spaces. method Complete classification and description of bases for specific lpn spaces. result Complete classification and description of Auerbach bases for lp3 and lp2. Stability result for nearly isometric subspaces and Finsler surfaces.
problem Stability of normed spaces and Finsler surfaces under near-isometric conditions.
method Refined topological argument and explicit quantification using Banach-Mazur distance.
result A 2-dimensional surface with near-monochromatic Finsler metric is approximately Riemannian.
The paper proves a conjecture about the shape of floating bodies.
problem The shape of bodies of flotation and buoyancy.
method Modern differential geometry techniques.
result If a body of flotation is homothetic to a body of buoyancy, it must be an ellipse.
This work explores representation complexity in RL paradigms, revealing model-based RL as the easiest task.
problem Investigating the representation complexity gap among model-based, policy-based, and value-based RL.
method Demonstrated through analysis of Markov decision processes (MDPs) and introduced new classes of MDPs.
result Representation complexity hierarchy: model-based RL > policy-based RL > value-based RL.
Flow-based data sets are necessary for evaluating network-based intrusion detection systems (NIDS). In this work, we propose a novel methodology for generating realistic flow-based network traffic. Our approach is based on Generative Adversarial Networks (GANs) which achieve good results for image generation. A major c…
We derive Gaussian approximations for random forest predictions using region-based stabilization.
problem Improving the accuracy of random forest predictions for Poisson process data.
method Region-based stabilization and Malliavin-Stein method for multivariate Gaussian approximation.
result Established Gaussian approximation bounds for random forest predictions under Poisson process.
Overparameterized models generalize well in offline contextual bandits, but policy-based algorithms struggle.
problem The performance gap between value-based and policy-based algorithms in offline contextual bandits with overparameterized models.
method Analysis of action-stability in objectives and formal proofs of regret bounds.
result The performance gap is due to action-stability of objectives, with value-based objectives being stable and policy-based objectives unstable.
Introduces LoCA regret to evaluate model-based RL methods.
problem Lack of consistent metrics to evaluate model-based RL methods.
method Inspired by neuroscience, introduces LoCA regret to measure model-based behavior.
result LoCA regret can identify model-based behavior and assess how close methods are to optimal model-based behavior.
Synthetic construction of 3D complex bases.
problem Creating a complete set of unbiased bases in 3D complex space.
method Synthetic construction using complex projective trigonometry.
result Synthetic construction of mutually unbiased bases in C^3.
Starting from the requirement that risk measures of financial portfolios should be based on their losses, not their gains, we define the notion of loss-based risk measure and study the properties of this class of risk measures. We characterize loss-based risk measures by a representation theorem and give examples of su…
We propose a direction of arrival (DOA) estimation method that combines sound-intensity vector (IV)-based DOA estimation and DNN-based denoising and dereverberation. Since the accuracy of IV-based DOA estimation degrades due to environmental noise and reverberation, two DNNs are used to remove such effects from the obs…
New DQ based on expectiles improves portfolio diversification.
problem Improving diversification in financial portfolios.
method Diversification quotient based on expectiles, offering simple formulas and pseudo-convexity.
result The expectile-based DQ is efficient and effective in portfolio optimization.
Improved hypothesis testing and change-point detection using diffusion-based methods.
problem Limited power of score-based hypothesis tests and change-point detection.
method Extending score-based Fisher divergence to diffusion-divergence by multiplying score functions with a matrix-valued function or weight matrix.
result Theoretical quantification and demonstration of optimal performance of diffusion-based algorithms.
Lookahead pruning extends single-layer optimization to multi-layer, outperforming magnitude-based pruning.
problem Pruning neural networks to reduce computational cost and memory usage.
method Developed a multi-layer optimization approach extending the single-layer optimization of magnitude-based pruning.
result Consistently outperforms magnitude-based pruning on various networks, especially in high sparsity.
The success of kernel-based learning methods depend on the choice of kernel. Recently, kernel learning methods have been proposed that use data to select the most appropriate kernel, usually by combining a set of base kernels. We introduce a new algorithm for kernel learning that combines a {\em continuous set of base …
Simple model-based reinforcement learning outperforms model-free methods in complex tasks.
problem Lagging performance of model-based reinforcement learning agents in non-trivial environments.
method Combining soft value estimates with stochastic value gradients.
result Simple model-based agents achieve state-of-the-art results in a high-dimensional humanoid control task.
Paper explores EEG-based speech recognition using transformers, showing faster training and better performance for smaller vocabularies.
problem Continuous speech recognition using EEG features.
method Transformer-based ASR model compared to RNN-based models.
result Transformer models perform better for smaller vocabularies but RNN models outperform them for larger vocabularies.
Improves graph-based active learning for non-Gaussian models.
problem Efficiently selecting data points for labeling in graph-based semi-supervised learning.
method Approximates non-Gaussian distributions, introduces rank-one update and model change acquisition function.
result Enhanced active learning for graph-based SSL under non-Gaussian models.
POMBU improves model-based RL's asymptotic performance by estimating and using uncertainty.
problem Model-based reinforcement learning struggles with model errors, leading to suboptimal performance.
method POMBU uses estimated uncertainty to optimize policies conservatively, improving asymptotic performance.
result POMBU outperforms existing methods in sample efficiency and asymptotic performance.
A neural network model minimizes region-based free energy for faster inference in MRFs.
problem Efficient inference in complex Markov random fields (MRFs).
method Region-based Energy Neural Network (RENN) that directly minimizes region-based free energy.
result RENN outperforms other methods in marginal distribution estimation, partition function estimation, and MRF learning.
In this paper, we develop and explore deep anomaly detection techniques based on the capsule network (CapsNet) for image data. Being able to encoding intrinsic spatial relationship between parts and a whole, CapsNet has been applied as both a classifier and deep autoencoder. This inspires us to design a prediction-prob…
Proposes new methods for interpreting document classification models.
problem Interpretation fragility of attention-based neural networks.
method Corpus-level and concept-based explanation methods using attention weights.
result Extracts semantically meaningful keywords and concepts for model predictions.
Deep RL optimizes goal-based investing strategies.
problem Optimizing investment strategies for achieving financial goals.
method Novel deep reinforcement learning approach for goal-based investing.
result Superior performance compared to benchmarks.
Study batch reinforcement learning methods for personalized medical treatments.
problem Batch reinforcement learning for personalized medical treatments.
method Direct policy learning and model-based learning approaches.
result Model-based learning is impossible with finite model classes but feasible with relaxed conditions.
New method combines gradient optimization with constraint-based techniques for causal discovery.
problem Causal discovery from observational data, especially with small sample sizes.
method Differentiable d-separation scores using percolation theory and soft logic for gradient-based optimization of conditional independence constraints. result Empirical evaluations show robust performance in low-sample regimes, surpassing traditional methods.
Gradient-based MCMC for discrete spaces improves sampling performance.
problem Sampling in discrete spaces using traditional methods is challenging.
method Introduced new discrete Metropolis-Hastings samplers inspired by MALA, with a novel preconditioning technique.
result Demonstrated strong empirical performance across various challenging sampling problems.
GEBM combines energy function and base distribution for better generative modeling.
problem Improving generative models with better quality samples and performance.
method Alternating training between energy function and base distribution, using MCMC for sampling.
result GEBMs produce higher quality samples and better performance than GANs.
New method trains energy-based models faster and more stably.
problem Training efficiency and stability of energy-based models.
method EBFlow with score-matching objectives.
result EBFlow achieves significant speedup and better performance.
Domain adaptation is essential to enable wide usage of deep learning based networks trained using large labeled datasets. Adversarial learning based techniques have shown their utility towards solving this problem using a discriminator that ensures source and target distributions are close. However, here we suggest tha…
Sphere-bases for simplicial and cubical complexes are constructed and analyzed.
problem Constructing and analyzing geometric properties of sphere-bases for simplicial and cubical complexes.
method Algorithmically-specified family of k+1-simplices or k+1-cubes are used to form the boundaries of sphere-bases.
result Geometric properties of constructed sphere-bases are investigated.
EB-RANSAC uses energy-based model for robust estimation without complex sampling.
problem Robust estimation of parameters in noisy data.
method EB-RANSAC combines RANSAC's sampling scheme with an energy-based model, simplifying the process and reducing hyperparameter requirements.
result EB-RANSAC effectively solves linear regression and maximum likelihood estimation problems.
Compression-based similarity measures are effectively employed in applications on diverse data types with a basically parameter-free approach. Nevertheless, there are problems in applying these techniques to medium-to-large datasets which have been seldom addressed. This paper proposes a similarity measure based on com…
In this paper, we investigate deep learning (DL)-enabled signal demodulation methods and establish the first open dataset of real modulated signals for wireless communication systems. Specifically, we propose a flexible communication prototype platform for measuring real modulation dataset. Then, based on the measured …
Knowledge bases contribute to many web search and mining tasks, yet they are often incomplete. To add missing facts to a given knowledge base, various embedding models have been proposed in the recent literature. Perhaps surprisingly, relatively simple models with limited expressiveness often performed remarkably well …
We review the utility-based valuation method for pricing derivative securities in incomplete markets. In particular, we review the practical approach to the utility-based pricing by the means of computing the first order expansion of marginal utility-based prices with respect to a small number of random endowments.
New models handle survival analysis with concept-based learning.
problem Survival analysis tasks involving event times with censored data.
method SurvCBM and SurvRCM models integrating concept-based learning with survival analysis.
result SurvCBM outperforms traditional survival models in numerical experiments.
GATES improves neural architecture search by modeling operations as information transformation.
problem Improving predictor-based neural architecture search efficiency.
method GATES models operations as information transformation, covering both node and edge cell search spaces.
result GATES boosts sample efficiency and improves predictor performance.
Parity defined for based matrices, a new example of virtual knot parity.
problem Defining parity for a new algebraic structure.
method Introduced parity for based matrices, defined reduced stable parity.
result New example of parity for virtual knots.
Detrended fluctuation analysis (DFA) is a simple but very efficient method for investigating the power-law long-term correlations of non-stationary time series, in which a detrending step is necessary to obtain the local fluctuations at different timescales. We propose to determine the local trends through empirical mo…
We investigate the validity of the equivalence principle along paths in gravitational theories based on derivations of the tensor algebra over a differentiable manifold. We prove the existence of local bases, called normal, in which the components of the derivations vanish along arbitrary paths. All such bases are expl…
Loop group method varies with base point choice.
problem Dependence of loop group method on base point choice.
method Analyzes how loop group method for harmonic maps varies with base point.
result Loop group method results depend on base point selection.
Unsupervised relation discovery aims to discover new relations from a given text corpus without annotated data. However, it does not consider existing human annotated knowledge bases even when they are relevant to the relations to be discovered. In this paper, we study the problem of how to use out-of-relation knowledg…
Model-based machine learning improves communication systems.
problem Improving symbol detection in communication receivers.
method Review and comparison of model-based and deep learning approaches, focusing on deep unfolding and DNN-aided hybrid algorithms.
result Different strategies of conventional deep architectures and hybrid algorithms show advantages and drawbacks.
M3PO improves model-based meta-RL with theoretical guarantees.
problem Improving sample efficiency in multi-task RL with theoretical guarantees.
method Extending Janner et al. (2019) theorems, proposing M3PO with performance guarantees.
result M3PO outperforms existing methods in continuous-control benchmarks.
Unified kernel-based methods improve nonlinear causal discovery.
problem Identifying nonlinear causal relationships between time series variables.
method Unified Kernel Principal Component Regression (KPCR) and Gaussian Process score-based model with Smooth Information Criterion.
result Improved performance in time series nonlinear causal discovery.
We propose two neural network based mixture models in this article. The proposed mixture models are explicit in nature. The explicit models have analytical forms with the advantages of computing likelihood and efficiency of generating samples. Computation of likelihood is an important aspect of our models. Expectation-…
We study the (2+2)-Einstein warped product manifolds, where the scalar curvature of the Base is a multiple of the warping function, and we called this condition (inside a warped product manifold) f-curvature-Base (RfB).The aim of this paper is to check if there are Base-manifolds with non-flat metrics that sa…
In our physically inspired in-tree (IT) based clustering algorithm and the series after it, there is only one free parameter involved in computing the potential value of each point. In this work, based on the Delaunay Triangulation or its dual Voronoi tessellation, we propose a nonparametric process to compute potentia…