Automated test model creation from semi-structured requirements.
problem Lack of automated solution for test model creation from requirements.
method Machine Learning for semi-structured requirement detection and rule-based translation.
result 86% time savings with no loss of quality.
Bayesian method for semi-structured models accounts for both types of uncertainty.
problem Lack of work on epistemic uncertainty in semi-structured regression models.
method Bayesian approximation with subspace inference for joint posterior sampling.
result Validated approach recovers structured effect posteriors and approaches full-space posterior.
This paper extends semi-structured networks to functional data.
problem Maintaining interpretability in functional data analysis while capturing non-linearities and interactions.
method Proposes a functional SSN method that scales well and improves predictive performance.
result The functional SSN method accurately recovers underlying signals and performs favorably compared to competing methods.
New PHO formula improves SSNs performance.
problem Suboptimal network estimation and degenerated predictions in SSNs.
method Non-invasive post-hoc orthogonalization (PHO) to identify model components.
result Better estimation and prediction quality in SSNs.
Study reduces redundant information in multi-modal datasets.
problem Redundant information increases data size and costs.
method Multimodal framework using entropy, mutual info, Lasso, SHAP, PCA, topic modeling.
result Significant feature space can be pruned with minimal loss in performance.
Proposes a new model to analyze mortgage delinquency transitions.
problem Analyzing mortgage delinquency transitions in a flexible yet identifiable way.
method Combines structured additive predictor with neural network for complex interactions, orthogonalising components for identifiability.
result The semi-structured model provides modest gains in discrimination compared to a structured model, especially in the early prediction spans.
Polytopic Matrix Factorization models data as latent vectors from a polytope, maximizing determinant for identifiability.
problem Data decomposition with semi-structured latent vectors and polytope constraints.
method Model input data as latent vectors from a polytope, using determinant maximization for identifiability.
result Identifiability condition for polytopes with specific symmetry restrictions.
Study reveals issues with neural autoregressive models and proposes mode recovery cost.
problem Unreasonable affinity of neural autoregressive models to short and long sequences.
method Investigates modes of ground-truth, empirical, and decoding-induced distributions via mode recovery cost.
result Mode recovery cost varies depending on ground-truth distribution and impacts decoding-induced distribution.
Flexible framework for deep distributional regression models.
problem Learning conditional distributions from semi-structured data.
method Combines additive regression models with deep networks using TensorFlow.
result State-of-the-art predictive performance with interpretability.
BF-VI improves posterior approximation in complex models.
problem Inefficient posterior approximations in complex models.
method Combines normalizing flows and Bernstein polynomial transformations.
result BF-VI outperforms other VI methods in approximating complex multivariate posteriors.
To date, there have been massive Semi-Structured Documents (SSDs) during the evolution of the Internet. These SSDs contain both unstructured features (e.g., plain text) and metadata (e.g., tags). Most previous works focused on modeling the unstructured text, and recently, some other methods have been proposed to model …
We present a neural network for predicting purchasing intent in an Ecommerce setting. Our main contribution is to address the significant investment in feature engineering that is usually associated with state-of-the-art methods such as Gradient Boosted Machines. We use trainable vector spaces to model varied, semi-str…
System suggests clinical concepts in real-time for faster note creation.
problem Efficiently creating structured clinical notes with minimal keystrokes.
method Contextual autocompletion using shallow neural networks.
result Reduces keystrokes by 67% in real hospital environments.
A deep learning framework for survival analysis combining piecewise exponential models.
problem Survival analysis with competing risks, multi-state modeling, and time-varying effects.
method Piecewise exponential models embedded in a neural network.
result Predicted Alzheimer's disease progression using tabular and 3D point cloud data.
Fair ML systems can be safe ML systems by considering uncertainty.
problem Safety of data-driven decision systems is often neglected.
method Viewing ML systems as socio-technical, uncertainty-aware modeling.
result Fair models should be uncertainty-aware, e.g. through distributional regression.
This study presents a multimodal machine learning model to predict ICD-10 diagnostic codes. We developed separate machine learning models that can handle data from different modalities, including unstructured text, semi-structured text and structured tabular data. We further employed an ensemble method to integrate all…
Study presents a low-cost local motion planner for vineyard navigation.
problem Autonomous navigation in vineyards with limited resources.
method RGB-D camera, dual layer control algorithm, deep learning synergy.
result Robust motion planning for vineyard navigation achieved.
Extends deep learning with interpretable additive models.
problem Identifiability issues between neural networks and additive models.
method Orthogonalization cell to separate deep neural network and structured model parts.
result Stable estimation and interpretability of structured model parts.
Transforms ensemble predictions to maintain interpretability.
problem Loss of interpretability in deep ensembles.
method Proposes transformation ensembles that aggregate predictions while preserving interpretability.
result Transformation ensembles yield better predictions than individual models and maintain interpretability.
Paper introduces methods to automatically generate SOAP notes from patient-physician conversations.
problem Burden of creating digital SOAP notes by physicians.
method Cluster2Sent algorithm for summarizing patient-physician conversations.
result Cluster2Sent algorithm outperforms existing methods by 8 ROUGE-1 points.
In this paper, we consider advancing web-scale knowledge extraction and alignment by integrating OpenIE extractions in the form of (subject, predicate, object) triples with Knowledge Bases (KB). Traditional techniques from universal schema and from schema mapping fall in two extremes: either they perform instance-level…
Graph-based methods are known to be successful in many machine learning and pattern classification tasks. These methods consider semi-structured data as graphs where nodes correspond to primitives (parts, interest points, segments, etc.) and edges characterize the relationships between these primitives. However, these …
COMET learns concepts for few-shot learning, improving performance.
problem Few-shot learning challenges in machine learning.
method Meta-learning with human-interpretable concept dimensions.
result Significant improvement in 1-shot learning tasks.
Paper uses graph structure to improve Wikipedia classification.
problem Classifying Wikipedia into a fine-grained named entity hierarchy.
method Explores graph descriptors and weighted models for feature vectors.
result Graph information reduces sparsity and improves classification.
Unified framework HASSLE-free decomposes large model weights into sparse and low-rank components.
problem Efficiently compress large foundation models to reduce inference costs.
method Designs a unified framework for sparse plus low-rank matrix decomposition with a local layer-wise reconstruction error objective.
result HASSLE-free framework significantly outperforms state-of-the-art methods in compression and evaluation benchmarks.
Study of public and private VC relationships in France using qualitative methods.
problem Understanding interactions between public and private venture capitalists in France.
method Qualitative approach with semi-structured interviews and thematic content analysis.
result Formal or informal relationships between public and private VCs are a 'economico-cognitive' approach to networking and innovation.
This letter assesses model risk in credit capital requirements and finds substantial tail risk.
problem Uncertainty in the probability of default and loss-given-default parameters in credit capital requirements.
method Models estimation risk in a simple way, analyzing two datasets and testing parameter dependency.
result Parameter dependency significantly increases tail risk in capital requirements, requiring substantial increases in regulatory capital.
Study introduces new methods to estimate equity and liability required rates of return.
problem Estimating the required rates of return for equity and liabilities of companies.
method Used maximum likelihood, Bayesian, Kalman filtering, and market value evaluation methods.
result The new methods can accurately estimate the required rates of return.
This work improves SGD convergence by adaptively adjusting batch sizes.
problem High variance in gradient estimates with small batch sizes.
method Adaptive batch size adjustment based on model training loss.
result Adaptive batch size method requires fewer model updates with same computation.
Requirements elicitation requires extensive knowledge and deep understanding of the problem domain where the final system will be situated. However, in many software development projects, analysts are required to elicit the requirements from an unfamiliar domain, which often causes communication barriers between analys…
Study introduces new methods to estimate stock return rates.
problem Estimating the required rate of return for stocks and private companies.
method Maximum likelihood, Bayesian, and Kalman filtering methods applied to historical data.
result Suggested methods can accurately estimate the required rate of return.
Quantum advantage in derivative pricing requires 8k qubits and 54M T-depth.
problem Quantum advantage in pricing derivatives.
method Re-parameterization method combining pre-trained variational circuits and fault-tolerant quantum computing.
result Benchmark use cases require 8k logical qubits and a T-depth of 54 million.
Paper develops a model to assess capital requirement for demographic risk using stochastic methods.
problem Quantifying capital requirement for demographic risk in life insurance contracts.
method Stochastic model extending local GAAP to Solvency II framework, proving market consistency.
result Model highlights main drivers of capital requirement evaluation, comparing to GAAP.
Key to the imposition of appropriate minimum capital requirements on a daily basis requires accurate volatility estimation. Here, measures are presented based on discrete estimation of aggregated high frequency UK futures realisations underpinned by a continuous time framework. Squared and absolute returns are incorpor…
A Nash game theory approach allocates capital requirements among financial institutions.
problem Allocating systemic risk measures among financial institutions.
method Proposes a Nash allocation rule inspired by game theory.
result Provides sufficient conditions for the existence and uniqueness of Nash allocation rules.
This paper provides a framework for modeling the financial system with multiple illiquid assets when liquidation of illiquid assets is caused by failure to meet a leverage requirement. This extends the network model of Cifuentes, Shin & Ferrucci (2005) which incorporates a single asset with fire sales and capital adequ…
In this paper the dependence of wealth distribution and the velocity of money on the required reserve ratio is examined based on a random transfer model of money and computer simulations. A fractional reserve banking system is introduced to the model where money creation can be achieved by bank loans and the monetary a…
Financial institutions are currently required to meet more stringent capital requirements than they were before the recent financial crisis; in particular, the capital requirement for a large bank's trading book under the Basel 2.5 Accord more than doubles that under the Basel II Accord. The significant increase in cap…
Bayes classifier cannot be learned from noisy labels without knowing noise distribution.
problem Learning a Bayes classifier from noisy labels when the noise distribution is unknown.
method Demonstrates the identifiability issues and proposes a simple algorithm for learning the Bayes decision rule.
result The Bayes decision rule is generally unidentified and cannot be learned without knowing the noise distribution.
This paper presents a Bayesian optimization method with exponential convergence without the need of auxiliary optimization and without the delta-cover sampling. Most Bayesian optimization methods require auxiliary optimization: an additional non-convex global optimization problem, which can be time-consuming and hard t…
Boosting combines weak classifiers to form highly accurate predictors. Although the case of binary classification is well understood, in the multiclass setting, the "correct" requirements on the weak classifier, or the notion of the most efficient boosting algorithms are missing. In this paper, we create a broad and ge…
We provide an upper bound on the number of ordered Reidemeister moves required to pass between two diagrams of the same link. This bound is in terms of the number of unordered Reidemeister moves required.
Develops deep learning for optimizing 5G radio resource allocation.
problem Optimizing 5G base station radio resources for diverse QoS requirements.
method Cascaded neural network structure with deep transfer learning for non-stationary conditions.
result Cascaded neural networks outperform fully connected neural networks in QoS guarantee.
Study assesses health plan risk measures for Solvency Capital Requirement.
problem Assessing risk measures for health plans to meet Solvency Capital Requirement.
method Three-part regression model with three GLMs for claim counts, episode allocation, and severity.
result Reduction in regression models compared to traditional methods.
We propose an online convex optimization algorithm (RescaledExp) that achieves optimal regret in the unconstrained setting without prior knowledge of any bounds on the loss functions. We prove a lower bound showing an exponential separation between the regret of existing algorithms that require a known bound on the los…
The aim of this paper is to define the market-consistent multi-period value of an insurance liability cash flow in discrete time subject to repeated capital requirements, and explore its properties. In line with current regulatory frameworks, the approach presented is based on a hypothetical transfer of the original li…
Three hard diagrams of the unknot require extra crossings to simplify.
problem Finding diagrams of the unknot that require many crossings to simplify.
method Applying previously proposed methods to construct diagrams and using computational resources to prove their hardness.
result Three hard diagrams of the unknot require at least three extra crossings.
Clarifies the theory of the deconfounder by Imai and Jiang.
problem Theoretical requirements for the deconfounder algorithm.
method Clarifies the assumption of 'no unobserved single-cause confounders' using empirical studies.
result Imai and Jiang's clarification of the assumption does not hold for counterexamples proposed by Ogburn et al. (2020).