the proceedings contain 98 papers. the topics discussed include: optimal pricing in black box producer-consumer Stackelberg games using revealed preference feedback;learning warm-start points for AC optimal power flow...
ISBN:
(纸本)9781728108247
the proceedings contain 98 papers. the topics discussed include: optimal pricing in black box producer-consumer Stackelberg games using revealed preference feedback;learning warm-start points for AC optimal power flow;minimax active learning via minimal model capacity;multi-step chord sequence prediction based on aggregated multi-scale encoder-decoder networks;robust hybrid beamforming with quantized deep neural networks;a machinelearning approach for classifying faults in microgrids using wavelet decomposition;robust importance-weighted cross-validation under sample selection bias;interpretable online banking fraud detection based on hierarchical attention mechanism;and a benchmark study of backdoor data poisoning defenses for deep neural network classifiers and a novel defense.
the problem of linear adaptive filtering (or equivalently, online regression) in the presence of non-Gaussian noise is addressed. One efficient way in face of environments with non-Gaussian noise is to employ informat...
详细信息
ISBN:
(纸本)9781728108247
the problem of linear adaptive filtering (or equivalently, online regression) in the presence of non-Gaussian noise is addressed. One efficient way in face of environments with non-Gaussian noise is to employ information theoretic criteria such as correntropy. In this study, a new algorithm based on correntropy is proposed, and demonstrated to outperform previous works in terms of both convergence speed and steady-state misalignment. At the same time, the proposed algorithm benefits from lower computational complexity compared to some of these algorithms.
Subspace clustering methods based on expressing each data point as a linear combination of all other points in a dataset are popular unsupervised learning techniques. However, existing methods incur high computational...
详细信息
ISBN:
(纸本)9781728108247
Subspace clustering methods based on expressing each data point as a linear combination of all other points in a dataset are popular unsupervised learning techniques. However, existing methods incur high computational complexity on large-scale datasets as they require solving an expensive optimization problem and performing spectral clustering on large affinity matrices. this paper presents an efficient approach to sub-space clustering by selecting a small subset of the input data called landmarks. the resulting subspace clustering method in the reduced domain runs in linear time with respect to the size of the original data. Numerical experiments on synthetic and real data demonstrate the effectiveness of our method.
Particle Gibbs with ancestor sampling is an efficient and statistically principled algorithm for learning of dynamic systems. However, the ancestor sampling step used to improve mixing of the Markov chain requires the...
详细信息
ISBN:
(纸本)9781728108247
Particle Gibbs with ancestor sampling is an efficient and statistically principled algorithm for learning of dynamic systems. However, the ancestor sampling step used to improve mixing of the Markov chain requires the possibly expensive calculation of a set of ancestor weights for the complete particle system. In this paper, we propose a rejection-sampling-based algorithm for ancestor sampling in particle Gibbs that mitigates this problem. Additionally, performance guarantees and a fallback strategy to prevent suffering from high rejection rates are discussed. the performance of the method is illustrated in two numerical examples.
In this paper, we derive generic bounds on the maximum deviations in prediction errors for sequential prediction via an information-theoretic approach. the fundamental bounds are shown to depend only on the conditiona...
详细信息
ISBN:
(纸本)9781728108247
In this paper, we derive generic bounds on the maximum deviations in prediction errors for sequential prediction via an information-theoretic approach. the fundamental bounds are shown to depend only on the conditional entropy of the data point to be predicted given the previous data points. In the asymptotic case, the bounds are achieved if and only if the prediction error is white and uniformly distributed.
In this article, we address the problem of estimating the state and learning of the parameters in a linear dynamic system with generalized L-1-regularization. Assuming a sparsity prior on the state, the joint state es...
详细信息
ISBN:
(纸本)9781728108247
In this article, we address the problem of estimating the state and learning of the parameters in a linear dynamic system with generalized L-1-regularization. Assuming a sparsity prior on the state, the joint state estimation and parameter learning problem is cast as an unconstrained optimization problem. However, when the dimensionality of state or parameters is large, memory requirements and computation of learning algorithms are generally prohibitive. Here, we develop a new augmented Lagrangian Kalman smoother method for solving this problem, where the primal variable update is reformulated as Kalman smoother. the effectiveness of the proposed method for state estimation and parameter learning is demonstrated in spectro-temporal estimation tasks using both synthetic and real data.
A large amount of data has been generated by grid operators solving AC optimal power flow (ACOPF) throughout the years, and we explore how leveraging this data can be used to help solve future ACOPF problems. We use t...
详细信息
ISBN:
(纸本)9781728108247
A large amount of data has been generated by grid operators solving AC optimal power flow (ACOPF) throughout the years, and we explore how leveraging this data can be used to help solve future ACOPF problems. We use this data to train a Random Forest to predict solutions of future ACOPF problems. To preserve correlations and relationships between predicted variables, we utilize a multi-target approach to learn approximate voltage and generation solutions to ACOPF problems directly by only using network loads, without the knowledge of other network parameters or the system topology. We explore the benefits of using the learned solution as an intelligent warm start point for solving the ACOPF, and the proposed framework is evaluated numerically using multiple ieee test networks. the benefit of using learned ACOPF solutions is shown to be solver and network dependent, but shows promise for quickly finding approximate solutions to the ACOPF problem.
Online banking activities are constantly growing and are likely to become even more common as digital banking platforms evolve. One side effect of this trend is the rise in attempted fraud. However, there is very litt...
详细信息
ISBN:
(纸本)9781728108247
Online banking activities are constantly growing and are likely to become even more common as digital banking platforms evolve. One side effect of this trend is the rise in attempted fraud. However, there is very little work in the literature on online banking fraud detection. We propose an attention based architecture for classifying online banking transactions as either fraudulent or genuine. the proposed method allows transparency to its decision by identifying the most important transactions in the sequence and the most informative features in each transaction. Experiments conducted on a large dataset of real online banking data demonstrate the effectiveness of the method in terms of both classification accuracy and interpretability of the results.
this paper examines a deep feedforward network for beamforming withthe single-snapshot sample covariance matrix (SCM). the conventional beamforming formulation, typically quadratic in the complex weight space, is ref...
详细信息
ISBN:
(纸本)9781728108247
this paper examines a deep feedforward network for beamforming withthe single-snapshot sample covariance matrix (SCM). the conventional beamforming formulation, typically quadratic in the complex weight space, is reformulated as real and linear in the weight covariance and SCM. the reformulated SCMs are used as input to a deep feed-forward neural network (FNN) for two source localization. Simlations demonstrate the effect of source incoherence and performance in a noisy tracking example. the FNN beamformer is experimentally tested on the Swellex96 experiment S95 source tow with a loud interferer.
this paper introduces a hierarchical learning paradigm based on a predesigned directional filter bank front-end analogous to the energy model for complex cells. the filter bank front-end is designed to extract common ...
详细信息
ISBN:
(纸本)9781728108247
this paper introduces a hierarchical learning paradigm based on a predesigned directional filter bank front-end analogous to the energy model for complex cells. the filter bank front-end is designed to extract common primitive features such as orientations and edges. Each energy response is subjected to a shunting inhibition operator to enhance contrast and reduce the effects of illumination variations. this is followed by a divisive-normalization, which bounds the responses of the feature maps. the normalized responses are then propagated through a two-layer convolutional neural network (CNN) back-end for classification. the efficiency of the proposed approach is demonstrated using the CIFAR-10 dataset, and its performance is compared against that of the DTCWT ScaterNet front-end.
暂无评论