Deep learning outperforms classical methods in categorizing BIM images.
problem Classifying building designs from BIM models.
method Used classical machine learning (HOG + SVM) and deep learning models (pre-trained and custom-designed networks).
result Deep learning models achieve significantly higher accuracy (above 89%) compared to classical methods (57%).
A transfer learning method builds high-dimensional models using disparate datasets.
problem Building comprehensive prediction models with small sample sizes and limited features.
method Transfer learning approach using external data to build a reduced model and apply calibration equations.
result Proposes a penalized generalized method of moment framework for inference and one-step estimation.
Research builds an index measuring analysts' perception of informational asymmetry.
problem Measuring the level of informational asymmetry among companies.
method Developed an algorithm based on Elo rating to capture analysts' perception.
result The model shows good fit with significant variables: coverage, volatility, Tobin q, and size.
Tangent Works won GEFCom 2017 using automatic model building.
problem Forecasting time series with historical temperature shuffling.
method Automatic model building using Tangent Information Modeller (TIM) with historical temperature shuffling and decision on trend variable.
result Automated model building setup won the competition.
Machine learning detects building damage in satellite images.
problem Extracting damage information from satellite imagery is slow and labor-intensive.
method Used four convolutional neural network models to detect damaged buildings.
result Models performed well in detecting damaged buildings in the 2010 Haiti earthquake.
The paper explores how regularization can lead to convergence in imperfect information games.
problem Finding equilibrium in imperfect information games with imperfect information.
method Investigates Follow the Regularized Leader dynamics and how adding a regularization term can lead to strong convergence guarantees.
result The approach leads to algorithms that converge exactly to the Nash equilibrium in imperfect information games.
Study builds tools to detect misinformation in online medical videos.
problem Misleading information in online medical videos.
method Manual annotation of a dataset, use of linguistic, acoustic, and user engagement features for classification models.
result Automatic models can identify misinformation with up to 74% accuracy.
This paper surveys smart buildings using machine learning and big data.
problem Improving comfort and efficiency in smart buildings through data analysis.
method Survey of machine learning and big data techniques for smart buildings.
result Machine learning and big data are crucial for smart building services.
Paper models limit order book with informed traders and market makers.
problem Modeling the limit order book with heterogeneous market participants.
method Agent-based model with four types of participants: informed traders, noise traders, informed market makers, and noise market makers. Based on Glosten-Milgrom and Huang-Rosenbaum-Saliba approaches.
result Derived the static limit order book characteristics and compared them with existing models.
Paper proposes PI-DAE for missing data imputation in buildings using physics constraints.
problem Missing data in building energy modeling.
method Physics-informed Denoising Autoencoders (PI-DAE) with multivariate and univariate configurations.
result Enhanced interpretability and robustness to missing data rates.
Proposes a method to improve surrogate models by incorporating sensitivity information.
problem Pruned neural networks often fail to capture sensitivities and uncertainties of original models.
method Combines Interval Adjoint Significance Analysis and Sobolev Training to accurately model sensitivities.
result Pruned models based on the proposed method better match original sensitivities.
Novel probabilistic models forecast residential heating and electricity demand at hourly resolution.
problem Accurate hourly forecasting of residential heating and electricity demand.
method Probabilistic deep learning models trained on gas-heated region data.
result Significant improvement in forecast accuracy compared to NREL's ResStock model.
Deep latent variable models are powerful tools for representation learning. In this paper, we adopt the deep information bottleneck model, identify its shortcomings and propose a model that circumvents them. To this end, we apply a copula transformation which, by restoring the invariance properties of the information b…
Exponential models of distributions are widely used in machine learning for classiffication and modelling. It is well known that they can be interpreted as maximum entropy models under empirical expectation constraints. In this work, we argue that for classiffication tasks, mutual information is a more suitable informa…
Probabilistic modeling is a powerful approach for analyzing empirical information. We describe Edward, a library for probabilistic modeling. Edward's design reflects an iterative process pioneered by George Box: build a model of a phenomenon, make inferences about the model given data, and criticize the model's fit to …
A model predicts building damage locations in near real-time using intensity-based features.
problem Accurate and timely damage diagnosis of building structures after extreme events.
method Support vector machines and Bayesian optimization for probabilistic hazard intensity determination.
result The model achieves 83.1% accuracy in identifying damage locations in a reinforced concrete moment frame.
Enhances counterfactual explanations with more valid and informative saliency maps.
problem Lack of valid counterfactual explanations in existing models.
method Introduces a modified approach to CELS model by removing mask normalization.
result Demonstrates higher validity and more informative counterfactual explanations.
Integrating visual and linguistic information into a single multimodal representation is an unsolved problem with wide-reaching applications to both natural language processing and computer vision. In this paper, we present a simple method to build multimodal representations by learning a language-to-vision mapping and…
2DSCNs improve image data analytics by extending SCN to handle spatial information.
problem Limitation of 1D SCNs in preserving spatial information of images.
method Extend SCN to 2DSCNs by stochastically configuring hidden nodes in a matrix-inputs framework.
result 2DSCNs outperform 1D SCNs in image data analytics tasks.
Modeling a temporal process as if it is Markovian assumes the present encodes all of the process's history. When this occurs, the present captures all of the dependency between past and future. We recently showed that if one randomly samples in the space of structured processes, this is almost never the case. So, how d…
The objective of this paper is to define an effective strategy for building an ensemble of Genetic Programming (GP) models. Ensemble methods are widely used in machine learning due to their features: they average out biases, they reduce the variance and they usually generalize better than single models. Despite these a…
This paper provides a neural approach to represent option implied information.
problem Link between implied density and volatility for arbitrage-free modeling.
method Minimalist perspective on implied volatility, neural representation with arbitrage constraints.
result Shallow feedforward network with a single hidden layer effectively approximates implied density and volatility.
A new method selects inducing points to optimize high-throughput Bayesian optimisation.
problem Current inducing point selection methods sacrifice high-fidelity modeling of promising regions.
method Information-theoretic criterion to select inducing points maximizing global and maximum value uncertainties.
result Surrogate models support high-precision high-throughput Bayesian optimisation.
Paper proposes PP-GCN for fine-grained social event categorization.
problem Challenges in mining social events due to heterogeneous event elements and social network structures.
method Design an event meta-schema, build an HIN, propose PP-GCN, and use KIES.
result PP-GCN outperforms other techniques in social event detection and clustering.
A new framework uses directed information to efficiently select context chunks.
problem Efficiently selecting relevant context chunks for query understanding.
method Directed Information γ-covering framework, formulated as a γ-cover problem, with a greedy algorithm for context selection. result The γ-covering algorithm provides clear advantages in hard-decision regimes like context compression and single-slot prompt selection. Paper proposes using MC-dropout to detect and diagnose incipient faults in buildings.
problem Lack of labeled incipient fault data in buildings.
method Proposes using Monte Carlo dropout (MC-dropout) to enhance deep neural networks for fault detection.
result Demonstrates effectiveness of MC-dropout in indicating likely incipient fault types.
The FSRM uses a multifractional process to capture price multifractality, revealing serial information for forecasting.
problem Capturing multifractal price dynamics for better forecasting.
method Developed a fractional stochastic regularity model based on multifractional processes and information theory.
result The serial information of the regularity process Ht can be theoretically determined, aiding in forecasting future price increments. A new method selects models for ensemble learning to maximize mutual information, outperforming existing approaches.
problem Selecting models for ensemble learning to improve performance and reduce correlation issues.
method Formulate budgeted ensemble selection as maximizing mutual information, use Gaussian-copula to model correlated errors, propose a greedy mutual-information selection algorithm.
result Our method consistently outperforms strong baselines across multiple datasets.
Attack reveals model details from counterfactual explanations.
problem Extracting model details from counterfactual explanations.
method Adversary uses counterfactual explanations to build high-fidelity model.
result High-fidelity and high-accuracy model extraction possible.
Information extraction and user intention identification are central topics in modern query understanding and recommendation systems. In this paper, we propose DeepProbe, a generic information-directed interaction framework which is built around an attention-based sequence to sequence (seq2seq) recurrent neural network…
In this paper, we exploit minimal sensing information gathered from biologically inspired sensor networks to perform exploration and mapping in an unknown environment. A probabilistic motion model of mobile sensing nodes, inspired by motion characteristics of cockroaches, is utilized to extract weak encounter informati…
RFpredInterval package builds prediction intervals for random forests and boosted forests.
problem Quantifying uncertainty in random forest and boosted forest point predictions.
method 16 methods to build prediction intervals with random forests and boosted forests.
result The proposed method outperforms existing methods in building prediction intervals.
A new algorithm PD improves stock-correlation network clustering and robustness.
problem Improving clustering and robustness of stock-correlation networks.
method Proposes a new proportional degree algorithm to filter information on a complete graph of normalised mutual information.
result The PD algorithm produces a network with better homogeneity and robustness compared to PMFG.
Determinantal point processes (DPPs) are elegant probabilistic models of repulsion that arise in quantum physics and random matrix theory. In contrast to traditional structured models like Markov random fields, which become intractable and hard to approximate in the presence of negative correlations, DPPs offer efficie…
Semantic TrueLearn uses semantic graphs to improve educational recommendation systems.
problem Challenges in handling semantic and hierarchical structure in knowledge areas.
method Introduces a novel learner model that exploits semantic relatedness between knowledge components using a Wikipedia link graph.
result Achieves statistically significant improvements in predictive performance for educational engagement.
Online leading has disrupted the traditional consumer banking sector with more effective loan processing. Risk prediction and monitoring is critical for the success of the business model. Traditional credit score models fall short in applying big data technology in building risk model. In this manuscript, data with var…
This study ranks feature-block importance in multiblock neural networks.
problem Understanding feature contributions in multiblock neural networks.
method Three methods: composite, knock-in, and knock-out strategies.
result Each strategy has its merits for specific application scenarios.
This paper builds a model to predict the long-term future in reinforcement learning.
problem Catastrophic failures due to flawed long-term predictions in reinforcement learning models.
method The authors develop a latent-variable autoregressive model using variational inference to incorporate future information.
result The model achieves higher rewards faster than baselines on various tasks and environments.
We consider the problem of performing matrix completion with side information on row-by-row and column-by-column similarities. We build upon recent proposals for matrix estimation with smoothness constraints with respect to row and column graphs. We present a novel iterative procedure for directly minimizing an informa…
Training examples are not all equally informative. Active learning strategies leverage this observation in order to massively reduce the number of examples that need to be labeled. We leverage the same observation to build a generic strategy for parallelizing learning algorithms. This strategy is effective because the …
Physics-informed kernel learning integrates physical priors into machine learning models.
problem Tackles the integration of physical laws into machine learning models for improved accuracy and efficiency.
method Uses Fourier methods to approximate the kernel and minimizes a physics-informed risk function.
result Demonstrates PIKL outperforms physics-informed neural networks and traditional PDE solvers in various scenarios.
The work investigates deep generative models, which allow us to use training data from one domain to build a model for another domain. We propose the Variational Bi-domain Triplet Autoencoder (VBTA) that learns a joint distribution of objects from different domains. We extend the VBTAs objective function by the relativ…
Graph learning categorizes DeFi services into similar functionalities.
problem Identifying similar financial services in decentralized finance protocols.
method Graph representation learning (GRL) to categorize smart contract blocks into clusters.
result Purity of clustering reaches .888 in the best-case scenario.
This paper explores AutoML for practical business applications.
problem Building machine learning models from data.
method Overview and benchmarking of AutoML algorithms.
result Recent benchmark results on AutoML algorithms.
Proposes TS-NMF for 2D clustering, preserving spatial info.
problem Loss of spatial information in 2D data.
method Semi-Nonnegative Matrix Factorization with manifold learning.
result Improves clustering performance compared to state-of-the-art.
Combines BERT and GCN for better text classification.
problem Limited global information capture by BERT.
method Integrates BERT with VGCN for improved text classification.
result VGCN-BERT outperforms BERT and GCN alone.
ERDMD discovers sparse, nonuniformly timed DMD models from chaotic attractors.
problem Discovering high-fidelity, nonuniformly timed DMD models from chaotic data.
method Entropic regression for nonlinear information flow detection, combined with multi-step DMD.
result ERDMD produces highly efficient and robust models with minimal complexity.
EvoRate metric assesses learnability of sequential data by measuring predictive information.
problem Model misspecification due to misinterpreting patterns in sequential data.
method Predictive information framework based on mutual information between past and future.
result Temporal patterns fundamentally constrain learnability; optimal predictors cannot outperform intrinsic information limit.