Abstract: This application discloses a program compilation method including: obtaining a first program, where the first program includes a plurality of layers of loop statements, a loop condition of each layer of loop statement in the plurality of layers of loop statements includes a variable and a value interval of the variable, and a loop body of the plurality of layers of loop statements includes at least one conditional statement; processing a value interval of a first variable in a first loop statement included in the plurality of layers of loop statements, to obtain a second loop statement; and compiling the first program based on at least one loop statement to obtain a compilation result of the first program.

Abstract: A method, computer system, and a computer program product for designing one or more folded structural proteins from at least one raw amino acid sequence is provided. The present invention may include computing one or more character embeddings based on the at least one raw amino acid sequence by utilizing a multi-scale neighborhood-based neural network (MNNN) model. The present invention may then include refining the computed one or more character embeddings with at least one set of sequence neighborhood information. The present invention may further include predicting one or more dihedral angles based on the refined one or more character embeddings.

Abstract: A graph neural network (GNN) training method, system, and computer program product in a graph, include generating, by the computing device, one or more one or more hypothetical edges between two or more nodes of a plurality of nodes of a graph neural network, testing, by the computing device, to determine whether the one or more generated hypothetical edges should be connected by using negative sampling, and permanently connecting, by the computing device, the one or more tested hypothetical edges if the negative sampling indicates the connectivity.

Abstract: An initial noisy graph topology is obtained and an initial adjacency matrix is generated by a similarity learning component using similarity learning and a similarity metric function. An updated adjacency matrix with node embeddings is produced from the initial adjacency matrix using a graph neural network (GNN). The node embeddings are fed back to revise the similarity learning component. The generating, producing, and feeding back operations are repeated for a plurality of iterations.

Abstract: Methods and systems for log message aggregation include determining a first similarity distance score for a first incoming message by comparing the first incoming message to one or more stored templates. It is determined that the first incoming message imperfectly matches a matched template of the one or more stored templates, based on the first similarity distance score. A token in the imperfectly matched template is replaced with a wildcard, to reduce the first similarity distance score.

Abstract: A method for compiling a sorting operator includes receiving a sorting parameter input by a user and a first primitive selected for invocation, where the sorting parameter and the first primitive are used to sort multi-dimensional data; generating a scheduling policy for the sorting operator based on the sorting parameter and the first primitive; and compiling a computation description and the scheduling policy for the sorting operator to obtain a sorting computation expression including the scheduling policy.

Abstract: A computer-implemented method for visual question generation includes training an alignment module to analyze an image, an answer hint, and a visual hint with respect to the image. A k-nearest neighbors (KNN) graph is constructed by performing an aligned embedding for each region of the image. A node embedding component is generated by using a graph embedding component of the KNN graph. A visual question is generated by sequence decoding each image and graph of the image.

Abstract: Techniques regarding identifying candidate knowledge graph subgraphs in a question answering over knowledge graph task are provided. For example, one or more embodiments described herein can comprise a system, which can comprise a memory that can store computer executable components. The system can also comprise a processor, operably coupled to the memory, and that can execute the computer executable components stored in the memory. The computer executable components can comprise a question answering over knowledge graph component that encodes graph structure information of a knowledge graph subgraph and a question graph into neural network embeddings.

Abstract: A method for recommending a product, includes: providing product information having a product description, a main image, and a plurality of alternate images; for each alternate image: performing saliency segmentation to obtain a segment and a background, defining a segment bounding box enclosing the segment, extracting image feature from the segment bounding box, extracting textual feature from the product description, extracting main image feature from the main image, matching the image feature of the segment bounding box to the textual feature and the main image feature, and determining the alternate image as a qualified alternate image if the image feature of the segment bounding box matches the textual feature and the main image feature; and when a number of the qualified alternate image equals to or is greater than a threshold number, recommending the product to customers.

Abstract: An adversarial robustness testing method, system, and computer program product include testing, via an accelerator, a robustness of a black-box system under different access settings, where the testing includes tearing down the robustness testing to a subtask of a predetermined size.

Abstract: This application discloses a program compilation method including: obtaining a first program, where the first program includes a plurality of layers of loop statements, a loop condition of each layer of loop statement in the plurality of layers of loop statements includes a variable and a value interval of the variable, and a loop body of the plurality of layers of loop statements includes at least one conditional statement; processing a value interval of a first variable in a first loop statement included in the plurality of layers of loop statements, to obtain a second loop statement; and compiling the first program based on at least one loop statement to obtain a compilation result of the first program.

Abstract: Computer-implemented techniques for unsupervised event extraction are provided. In one instance, a computer implemented method can include parsing, by a system operatively coupled to a processor, unstructured text comprising event information to identify candidate event components. The computer implemented method can further include employing, by the system, one or more unsupervised machine learning techniques to generate structured event information defining events represented in the unstructured text based on the candidate event components.

Abstract: A method (and structure and computer product) of machine translation for processing input questions includes receiving, in a processor on a computer, an input question presented in a natural language. The input question is preprocessed to find one or more condition values for possible Structured Query Language (SQL) queries. One or more possible SQL queries are enumerated based on the one or more found condition values and a paraphrasing model is used to rank the enumerated SQL queries. The highest ranked SQL query is executed against a relational database to search for a response to the input question.

Abstract: Obtain, at a computing device, a segment of computer code. With a classification module of a machine learning system executing on the computing device, determine a required annotation category for the segment of computer code. With an annotation generation module of the machine learning system executing on the computing device, generate a natural language annotation of the segment of computer code based on the segment of computer code and the required annotation category. Provide the natural language annotation to a user interface for display adjacent the segment of computer code.

Abstract: An adversarial robustness testing method, system, and computer program product include testing, via an accelerator, a robustness of a black-box system under different access settings, where the testing includes tearing down the robustness testing to a subtask of a predetermined size.

Abstract: Techniques that facilitate graph similarity analytics are provided. In one example, a system includes an information component and a similarity component. The information component generates a first information index indicative of a first entropy measure for a first graph-structured dataset associated with a machine learning system. The information component also generates a second information index indicative of a second entropy measure for a second graph-structured dataset associated with the machine learning system. The similarity component determines similarity between the first graph-structured dataset and the second graph-structured dataset based on a graph similarity computation associated with the first information index and the second information index.

Abstract: A system may include a memory and a processor in communication with the memory. The processor may be configured to perform operations. The operations may include training a neural network and predicting structural feature sets with the neural network. The operations may include producing predicted structures with the neural network using the structural feature sets, converting the predicted structures into predicted graphs with predicted edges, and comparing predicted graphs to training graphs and predicted edges to training edges to obtain a comparison. The operations may include training a model with the comparison, constructing a graph with the neural network using a node feature set, and reducing missing edges in the graph with the model.