Data-target pairing is an important step towards multi-target localization for the intelligent operation of unmanned systems. Target localization plays a crucial role in numerous applications, such as search, and rescue missions, traffic management and surveillance. The objective of this paper is to present an innovati…
Proposes a new method for finding non-redundant, standout subgroups in numeric datasets.
problem Mining large numbers of redundant subgroups in numeric datasets.
method Dispersion-aware problem formulation based on MDL principle for subgroup set discovery.
result Empirically demonstrates SSD++ returns outstanding subgroup lists.
New algorithm speeds up MCMC for complex distributions.
problem Efficient sampling from complex, high-dimensional distributions.
method Numerical Generalized Randomized Hamiltonian Monte Carlo with state-dependent event rates.
result Approximates Hamiltonian trajectories for robust sampling.
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.
Regularized target encoding beats traditional methods for high cardinality features in ML.
problem Efficiently encoding high cardinality categorical variables for ML algorithms.
method Regularized target encoding compared to traditional encodings like integer and one-hot encoding.
result Regularized target encoding consistently provided the best results in a large-scale benchmark experiment.
Data-target association is an important step in multi-target localization for the intelligent operation of un- manned systems in numerous applications such as search and rescue, traffic management and surveillance. The objective of this paper is to present an innovative data association learning approach named multi-la…
We propose a new Bayesian tracking and parameter learning algorithm for non-linear non-Gaussian multiple target tracking (MTT) models. We design a Markov chain Monte Carlo (MCMC) algorithm to sample from the posterior distribution of the target states, birth and death times, and association of observations to targets, …
We examine in this article the pricing of target volatility options in the lognormal fractional SABR model. A decomposition formula by Ito's calculus yields a theoretical replicating strategy for the target volatility option, assuming the accessibilities of all variance swaps and swaptions. The same formula also sugges…
In this paper, we propose a novel investment strategy for portfolio optimization problems. The proposed strategy maximizes the expected portfolio value bounded within a targeted range, composed of a conservative lower target representing a need for capital protection and a desired upper target representing an investmen…
Efficiently approximates integrals using a subset of samples from a target distribution in RKHS.
problem Approximating integrals with a target distribution using limited pointwise evaluations.
method Proposes a procedure using a small random subset of samples from the target distribution, either uniformly or using approximate leverage scores.
result Upper bound on approximation error for both sampling strategies, achieving optimal rate with reduced evaluations.
Researchers establish bounds for SGMs' KL and Wasserstein divergences under various noise schedules.
problem Estimating the error between target and estimated distributions in SGMs.
method Established upper bounds for KL divergence and Wasserstein distance, incorporating target distribution properties and SGM hyperparameters.
result Optimal noise schedules identified for SGMs, improving generative quality.
Paper optimizes portfolios for absolute return funds with constraints.
problem Optimizing portfolios with constraints for absolute return funds.
method Stochastic control framework with numerical solution using kernel-based collocation method.
result Leverage is necessary to achieve the target level.
A new gradient flow for MMD with closed-form implementation.
problem Existing gradient flows either lack tractable numerical implementation or require strong assumptions.
method Introduces a (de)-regularized Maximum Mean Discrepancy (DrMMD) and its gradient flow.
result Guarantees near-global convergence for a broad class of targets in both continuous and discrete time.
Method optimizes diffusion model generation to meet user preferences.
problem Optimizing diffusion model generation with only black-box target scores.
method Covariance-adaptive sequential optimization algorithm for black-box optimization.
result Proves superior performance in achieving better target scores.
Investigates numerical issues in GP interpolation parameter estimation.
problem Numerical issues in maximum likelihood parameter estimation for Gaussian process interpolation.
method Investigates and proposes strategies to improve open-source software implementations.
result Improves reliability and reproducibility of studies relying on GP implementations.
This paper presents a continuous-time model of intraday trading, pricing, and liquidity with dynamic TWAP and VWAP benchmarks. The model is solved in closed-form for the competitive equilibrium and also for non-price-taking equilibria. The intraday trajectories of TWAP trading targets cause predictable intraday pattern…
A new method aligns source and target distributions by tuning their weights.
problem Domain adaptation on unlabeled target datasets using labeled source datasets.
method Weighted Joint Distribution Optimal Transport (WJDOT) method that finds alignment between source and target distributions and re-weighting of source distributions.
result Achieves state-of-the-art performance on simulated and real-life datasets.
The optimal binning is the optimal discretization of a variable into bins given a discrete or continuous numeric target. We present a rigorous and extensible mathematical programming formulation for solving the optimal binning problem for a binary, continuous and multi-class target type, incorporating constraints not p…
A new method debiases multiple target parameters without IFs.
problem Debiasing multiple target parameters in nonparametric models.
method Kernel Debiased Plug-in Estimation (KDPE) using TMLE and reproducing kernel Hilbert spaces.
result KDPE simultaneously debiases all pathwise differentiable target parameters.
Berry et al. (1997) initiated the development of the infinite arms bandit problem. They derived a regret lower bound of all allocation strategies for Bernoulli rewards with uniform priors, and proposed strategies based on success runs. Bonald and Proutière (2013) proposed a two-target algorithm that achieves the regret…
Adaptive sampling method improves efficiency in complex target distributions.
problem Efficiency of importance sampling in complex target distributions, especially multimodal distributions in high-dimensional spaces.
method Proposes an adaptive scheme combining global sampling with delayed weighting to promote efficient exploration of target distributions.
result The proposed algorithm is geometrically convergent under mild assumptions and demonstrates improved efficiency in various numerical experiments.
L-HNNs improve Bayesian inference by reducing gradient requirements and improving ESS.
problem Efficient Bayesian inference with complex target densities.
method Latent Hamiltonian Neural Networks (L-HNNs) with NUTS, incorporating online error monitoring.
result L-HNNs in NUTS with online error monitoring required 1--2 orders of magnitude fewer numerical gradients and improved ESS by an order of magnitude.
This paper investigates the equilibrium interactions between trading targets and private information in a multi-period Kyle (1985) market. There are two investors who each follow dynamic trading strategies: A strategic portfolio rebalancer who engages in order splitting to reach a cumulative trading target and an uncon…
The use of orthogonal projections on high-dimensional input and target data in learning frameworks is studied. First, we investigate the relations between two standard objectives in dimension reduction, preservation of variance and of pairwise relative distances. Investigations of their asymptotic correlation as well a…
Unified approach for sampling non-differentiable and heavy-tailed targets.
problem Sampling non-differentiable and heavy-tailed distributions using Langevin algorithms.
method Anchored Langevin dynamics, which modifies the Langevin diffusion with a smooth reference potential and multiplicative scaling.
result Non-asymptotic guarantees in the 2-Wasserstein distance to the target distribution.
Develops G-MLKM for better data-target association in constrained spaces.
problem Data-target association problem in constrained spaces with limited sensor information.
method Graph-based multi-layer k-means++ (G-MLKM) method, including MLKM for local space and G-MLKM for general constrained space.
result Improves data-target association accuracy through error correction mechanisms.
ReTaSA tackles continuous target shift in regression problems.
problem Continuous target shift in regression settings.
method Nonparametric regularized approach to estimate importance weight function.
result The method provides theoretical justification for the estimated importance weight function.
We introduce an open source python framework named PHS - Parallel Hyperparameter Search to enable hyperparameter optimization on numerous compute instances of any arbitrary python function. This is achieved with minimal modifications inside the target function. Possible applications appear in expensive to evaluate nume…
UAV uses RL to navigate, map, and detect targets in unknown environments.
problem Optimizing UAV trajectory for accurate mapping and target detection in unknown environments.
method Formulated as an MDP, UAV uses RL to infer navigation policy.
result UAV autonomously explores high target detection areas while reconstructing the environment.
Equilibrium found for multi-agent trading with transaction costs.
problem Designing a trading equilibrium for multiple agents with transaction costs.
method Proving the existence of a continuous-time Radner equilibrium with incentives and transaction costs.
result Each agent optimally trades for a specific time interval before stopping, influenced by transaction costs.
The paper evaluates the probability distributions of analog-to-target distances for multiple analogs.
problem Understanding the performance of analog applications through the distribution of distances to target states.
method Theoretical analysis and numerical experiments using dynamical systems theory.
result The size of the catalog and dimensionality affect the probability distributions of the K-best analogs.
The paper studies how different entropic regularizations affect GAN solutions.
problem Improving numerical convergence and sparsity in GAN solutions.
method Entropic regularization of Wasserstein distance and Sinkhorn divergence.
result Entropy regularization promotes sparsity, while Sinkhorn divergence recovers unregularized solution.
Paper proposes methods to reduce financial contagion by targeted cash injections.
problem Financial contagion through interconnected networks.
method Dynamic model of payments with external control term for corrective cash injections.
result Targeted cash injections can significantly reduce default propagation.
Generative models improve for multiscale scientific data with new noise and interpolation techniques.
problem Numerical challenges in generating high-fidelity samples for multiscale scientific data.
method Design of noise distributions and interpolation schedules in function space to ensure Lipschitz regularity and finite noise roughness.
result Scale-adaptive noise and interpolation schedules improve numerical efficiency and fidelity of generated samples.
Proposes a self-attention-based method for drug-target interaction prediction.
problem Interpreting machine learning models for drug-target interactions.
method Self-attention-based multi-view representation learning approach.
result Competitive prediction performance with biologically interpretable results.
Improved numerical solution for BSDEs with reduced boundary errors.
problem Boundary errors in numerical solution of BSDEs.
method Modified damping and shifting schemes to transform target function into a bounded periodic function, applying Fourier transforms.
result Significant reduction in boundary errors with improved accuracy and convergence.
Develops HDNNs for mixed geoscience data inputs.
problem Lack of multisource, multi-scale information in deep learning studies.
method Hybrid architecture combining feature and target learning.
result HDNNs achieve higher accuracy and better generalization in reservoir prediction.
Proposes a new learning method for RBMs that combines strengths of forward and reverse KLD.
problem Underfitting and mode-collapse issues in RBM learning.
method Ratio divergence learning using target energy.
result Significantly outperforms other learning methods in energy function fitting, mode-covering, and stability.
Study shows how numerical discretization affects reconstructions and parameter distributions in nano metrology.
problem Impact of numerical discretization on parameter reconstructions and model parameter distributions.
method Bayesian target vector optimization, finite element model, Gaussian process, stochastic machine learning surrogate models, Markov chain Monte Carlo sampler.
result Numerical discretization parameters impact the accuracy and distribution of reconstructed model parameters.
Transferring knowledge across many streaming processes remains an uncharted territory in the existing literature and features unique characteristics: no labelled instance of the target domain, covariate shift of source and target domain, different period of drifts in the source and target domains. Autonomous transfer l…
Proposes a new method for variable importance using targeted learning.
problem Uncertainty quantification in variable importance metrics.
method Employing the targeted learning (TL) framework for conditional permutation variable importance.
result Improved accuracy in finite sample contexts compared to traditional methods.
Paper shows robust generative learning with minimal assumptions on target distributions.
problem Learning generative models with minimal assumptions on target distributions.
method Lipschitz-regularized α-divergences with minimal assumptions. result Stable learning across various target distributions with minimal assumptions.
In this paper, the optimal mean-reverting portfolio (MRP) design problem is considered, which plays an important role for the statistical arbitrage (a.k.a. pairs trading) strategy in financial markets. The target of the optimal MRP design is to construct a portfolio from the underlying assets that can exhibit a satisfa…
We present an interactive version of an evidence-driven state-merging (EDSM) algorithm for learning variants of finite state automata. Learning these automata often amounts to recovering or reverse engineering the model generating the data despite noisy, incomplete, or imperfectly sampled data sources rather than optim…
Robust subgroup discovery finds non-redundant, statistically significant subgroups.
problem Finding interpretable, robust subgroups from data.
method Formulated subgroup lists for univariate and multivariate targets, used MDL principle and greedy heuristic SSD++.
result SSD++ outperforms previous methods in quality and size of subgroup lists.
Localized transfer learning improves nonparametric regression performance.
problem Improving nonparametric regression performance on target tasks.
method Localized transfer learning framework that models heterogeneity and partition covariate space into cells.
result Sharp minimax rates show local transfer mitigates the curse of dimensionality.
In this work, we introduce a novel class of adaptive Monte Carlo methods, called adaptive independent sticky MCMC algorithms, for efficient sampling from a generic target probability density function (pdf). The new class of algorithms employs adaptive non-parametric proposal densities which become closer and closer to …
Wind power as a renewable source of energy, has numerous economic, environmental and social benefits. In order to enhance and control renewable wind power, it is vital to utilize models that predict wind speed with high accuracy. Due to neglecting of requirement and significance of data preprocessing and disregarding t…