Predicting industrial building energy consumption with statistical and machine-learning models informed by physical system parameters

S Kapp, JK Choi, T Hong - Renewable and Sustainable Energy Reviews, 2023 - Elsevier
The industrial sector consumes about one-third of global energy, making them a frequent
target for energy use reduction. Variation in energy usage is observed with weather …

Kernel mean embedding of distributions: A review and beyond

K Muandet, K Fukumizu… - … and Trends® in …, 2017 - nowpublishers.com
A Hilbert space embedding of a distribution—in short, a kernel mean embedding—has
recently emerged as a powerful tool for machine learning and statistical inference. The basic …

Randomized numerical linear algebra: Foundations and algorithms

PG Martinsson, JA Tropp - Acta Numerica, 2020 - cambridge.org
This survey describes probabilistic algorithms for linear algebraic computations, such as
factorizing matrices and solving linear systems. It focuses on techniques that have a proven …

Harmonizing transferability and discriminability for adapting object detectors

C Chen, Z Zheng, X Ding… - Proceedings of the …, 2020 - openaccess.thecvf.com
Recent advances in adaptive object detection have achieved compelling results in virtue of
adversarial feature adaptation to mitigate the distributional shifts along the detection …

Conditional adversarial domain adaptation

M Long, Z Cao, J Wang… - Advances in neural …, 2018 - proceedings.neurips.cc
Adversarial learning has been embedded into deep networks to learn disentangled and
transferable representations for domain adaptation. Existing adversarial domain adaptation …

[KNJIGA][B] Random matrix methods for machine learning

R Couillet, Z Liao - 2022 - books.google.com
This book presents a unified theory of random matrices for applications in machine learning,
offering a large-dimensional data vision that exploits concentration and universality …

[PDF][PDF] Compact bilinear pooling

Y Gao, O Beijbom, N Zhang… - Proceedings of the IEEE …, 2016 - cv-foundation.org
Bilinear models has been shown to achieve impressive performance on a wide range of
visual tasks, such as semantic segmentation, fine grained recognition and face recognition …

Random features for kernel approximation: A survey on algorithms, theory, and beyond

F Liu, X Huang, Y Chen… - IEEE Transactions on …, 2021 - ieeexplore.ieee.org
The class of random features is one of the most popular techniques to speed up kernel
methods in large-scale problems. Related works have been recognized by the NeurIPS Test …

An introduction to matrix concentration inequalities

JA Tropp - Foundations and Trends® in Machine Learning, 2015 - nowpublishers.com
Random matrices now play a role in many areas of theoretical, applied, and computational
mathematics. Therefore, it is desirable to have tools for studying random matrices that are …

Low-rank bilinear pooling for fine-grained classification

S Kong, C Fowlkes - … of the IEEE conference on computer …, 2017 - openaccess.thecvf.com
Pooling second-order local feature statistics to form a high-dimensional bilinear feature has
been shown to achieve state-of-the-art performance on a variety of fine-grained …