Algorithm finds knot friends in 3-manifolds.
problem Identifying knots that share similar 3-manifold complements.
method Developed an algorithm using SnapPy and Regina.
result Constructed a census of simple knots with friends.
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
169,051 papers · 148 categories
Trend · papers per month
48 results for “friend suggestions”
NAS model improves social recommendation accuracy using neural attention.
problem Capturing and weighing friends' preferences in social recommendation systems.
method Proposes a Neural Attention mechanism (NAS) for Social collaborative filtering.
result NAS model outperforms state-of-the-art methods in publicly available datasets.
Inner Market as a "Black Box"cond-mat.dis-nn
Each market has its singular characteristic. Its inner structure is directly responsible for the observed distributions of returns though this fact is widely overlooked. Big orders lead to doubling the tails. The behavior of a market maker with many or few ``friends'' who can reliably loan money or stock to him is quit…
Study of knots sharing 0-surgeries, classifying and computing their properties.
problem Understanding knots sharing the same 0-surgery.
method Created a census of knots with small crossing numbers and tetrahedral complexities, computed their smooth 4-genera, and developed a new obstruction for traces of knots.
result Computed the minimum of c(K)+c(K') and t(K)+t(K') among friends K and K'. Determined if traces of many friends are homeomorphic.
Friend recommendation system using heterogeneous edge embeddings.
problem Inadequate performance of existing network embedding techniques on multi-graph social networks.
method Proposes a method to mine network representation exploiting heterogeneity in multi-graphs.
result Outperforms state-of-the-art baselines on Hike's social network in terms of accuracy and user satisfaction.
Study analyzes WiFi check-ins to predict student activities.
problem Limited understanding of daily routines in POI prediction.
method Heterogeneous graph-based method to encode correlations.
result Improved POI prediction on education check-in data.
The problem of secure friend discovery on a social network has long been proposed and studied. The requirement is that a pair of nodes can make befriending decisions with minimum information exposed to the other party. In this paper, we propose to use community detection to tackle the problem of secure friend discovery…
This research finds three meta-indicators for university rankings.
problem Complexity in university ranking systems.
method Interpretable machine learning approach.
result Identified three meta-indicators: time, space, and relationships.
The paper optimizes risk-sharing in decentralized networks.
problem Optimizing risk-sharing among networked agents.
method Analyzes actuarially fair risk-sharing rules among friends in a network.
result Characterizes the optimal signed linear risk-sharing rule.
Predicting event attendance using social influence from social networks.
problem Predicting people's participation in real-world events.
method Modeling social influence, using non-geotagged posts and social group structures, applying graph embedding techniques, and training a neural network.
result The proposed classifier achieves 89% accuracy on the VFestival dataset, outperforming state-of-the-art methods.
This paper analyzes P2P collaborative insurance products and network structure impact.
problem Analyzing P2P collaborative insurance products and their network structure impact.
method Examined a P2P insurance product with reciprocal risk sharing contracts, studied network structure impact on risk reduction, and discussed optimal reciprocal commitments.
result The network structure, particularly the distribution of degrees, significantly impacts risk reduction in P2P insurance products.
Data mining revealed a cluster of economic, psychological, social and cultural indicators that in combination predicted corruption and wealth of European nations. This prosperity syndrome of self-reliant citizens, efficient division of labor, a sophisticated scientific community, and respect for the law, was clearly di…
Despite the overwhelming success of the existing Social Networking Services (SNS), their centralized ownership and control have led to serious concerns in user privacy, censorship vulnerability and operational robustness of these services. To overcome these limitations, Distributed Social Networks (DSN) have recently b…
This is a mainly expository article honoring my recently deceased friend and collaborator Krzysztof Galicki who died after a tragic hiking accident. I give a review of our recent work in Sasakian geometry. A few new results are also presented.
Social networks are getting closer to our real physical world. People share the exact location and time of their check-ins and are influenced by their friends. Modeling the spatio-temporal behavior of users in social networks is of great importance for predicting the future behavior of users, controlling the users' mov…
SafeAccess identifies people in smart homes for safer access.
problem Enhancing safety and independence for people with disabilities.
method Change detection, Faster-RCNN, LBP/FaceNet, MTCNN, MMS.
result Average F-score of 0.97 for identifying friends/families/caregivers versus intruders/unknown.
The paper analyzes user activities in OSNs using a vector space model.
problem Understanding user interactions and activity patterns in OSNs.
method TF-IDF scheme of Vector Space Model to analyze object-viewer relationships.
result Identified activity relationships among users and objects in OSNs.
Study on prime knots, slice obstructions, and ribbon concordances.
problem Determining which prime knots are slice in smooth and topological categories.
method Use of a wide range of tools and techniques, including new or refined methods for probing these properties.
result About 1.6 million prime knots are smoothly slice (ribbon), and 350.5 million are not even topologically slice.
Estimates peer influence effects using embeddings for social networks.
problem Estimating peer contagion effects in social networks with unobserved confounders.
method Nonparametrically adjusts for homophily using node embeddings.
result Formalizes causal effect of peer influence in social networks.
Enhances dialogue model with persona attributes using adversarial learning.
problem Improving dialogue models to better capture speaker identity and topic.
method Adversarial learning framework with a dual discriminator system.
result phredGAN outperforms persona Seq2Seq model in various datasets.
A deep learning strategy improves recommendation accuracy by leveraging trust and distrust relationships.
problem Data scarcity and cold-start problem in recommender systems.
method Social deep pairwise learning with a ranking loss function and social negative sampling.
result The proposed model achieves an 11.49% improvement over state-of-the-art methods.
Reward collapse occurs when ranking-based reward models yield uniform rewards for different prompts.
problem Reward collapse in aligning large language models with human preferences.
method Introduced a prompt-aware optimization scheme to derive closed-form expressions for reward distributions.
result Our prompt-aware utility functions significantly alleviate reward collapse during training.
Novel GNN method for semi-supervised clustering of signed networks.
problem Lack of effective node embeddings for signed network clustering.
method SSSNET: Probabilistic balanced normalized cut loss for GNN.
result SSSNET achieves comparable or better results than state-of-the-art methods.
Can we manipulate multiple deep neural networks simultaneously?
problem Selective fooling of multiple machine learning systems.
method Formulated as a novel optimization problem.
result It is easy to selectively manipulate multiple MNIST classifiers simultaneously.
A compass guides institutions towards ecological economics goals.
problem Aligning institutional goals with ecological economics principles.
method Develops a policy compass for institutions, incorporating ecological economics principles.
result Adapted policy compass aligns institutional actions with ecological economics goals.
Turaev transformed knot theory and 3-manifold invariants.
problem Understanding knots and links invariants of 3-manifolds.
method Classical topology techniques and quantum topology.
result Introduced new ideas and tools in knot theory and 3-manifold invariants.
We consider nonparametric estimation of , Renyi- and Tsallis- divergences between continuous distributions. Our approach is to construct estimators for particular integral functionals of two densities and translate them into divergence estimators. For the integral functionals, our estimators are based on cor…
New framework for knots on Seifert surfaces, no universal host.
problem Understanding how knots appear on minimal genus Seifert surfaces.
method Directed relation and friendship defined on knot types.
result No single knot is a universal host, but families can be.
Framework infers coordination strategies from movement data.
problem Inferring individual movement strategies from group data.
method Formalizes Coordination Strategy Inference Problem; provides methodology to infer strategies.
result Framework accurately infers strategies in simulated and real-world datasets.
This paper considers stochastic bandits with side observations, a model that accounts for both the exploration/exploitation dilemma and relationships between arms. In this setting, after pulling an arm i, the decision maker also observes the rewards for some other actions related to i. We will see that this model is su…
Power Assisted Trend Followingq-fin.TR
Develops a new trend power indicator using DSP techniques.
problem Determining the strength and reversibility of trends.
method Derives a novel indicator using digital signal processing.
result Accuracy of the new indicator correlates with PNL performance.
This paper will describe a novel approach to the cocktail party problem that relies on a fully convolutional neural network (FCN) architecture. The FCN takes noisy audio data as input and performs nonlinear, filtering operations to produce clean audio data of the target speech at the output. Our method learns a model f…
Suppose centers are fit to points by heuristically minimizing the -means cost; what is the corresponding fit over the source distribution? This question is resolved here for distributions with bounded moments; in particular, the difference between the sample cost and distribution cost decays with $…
Learning to cooperate with friends and compete with foes is a key component of multi-agent reinforcement learning. Typically to do so, one requires access to either a model of or interaction with the other agent(s). Here we show how to learn effective strategies for cooperation and competition in an asymmetric informat…
We present Deep Generalized Canonical Correlation Analysis (DGCCA) -- a method for learning nonlinear transformations of arbitrarily many views of data, such that the resulting transformations are maximally informative of each other. While methods for nonlinear two-view representation learning (Deep CCA, (Andrew et al.…
Combines global and local features for better social circle prediction in ego-networks.
problem Efficiently analyzing ego-networks with hidden local structures.
method Evolved deep learning techniques to capture both global and local network features.
result Social circle prediction benefits from a combination of global and local features.
Enhances persona-based conversation model for multi-turn dialogue.
problem Improving persona-based conversation models for multi-turn dialogue.
method Introduced additional input modality into hredGAN to capture external attributes.
result Persona hredGAN () outperforms existing models in multi-turn dialogue corpora.
In this study, the authors develop a structural model that combines a macro diffusion model with a micro choice model to control for the effect of social influence on the mobile app choices of customers over app stores. Social influence refers to the density of adopters within the proximity of other customers. Using a …
A new tensor-based method for predicting temporal relationships in knowledge bases.
problem Predicting temporal relationships in evolving knowledge bases.
method Tensor decomposition of order 4 with new regularization schemes.
result Achieves state-of-the-art performance in temporal link prediction.
Method finds interestingly dense subgroup connections in graphs.
problem Understanding patterns in graph connectivity based on node attributes.
method Information-theoretic definition of interestingness for subgroup connections.
result Identifies pairs of node subgroups with high or low edge density.
Sublinear memory sketch finds nearest neighbors in streaming data.
problem Finding nearest neighbors in large datasets with limited memory.
method Combines LSH, online kernel density estimation, and compressed sensing to achieve sublinear memory.
result Achieves sublinear memory performance on stable queries, reporting nearest neighbors efficiently.
Networks capture our intuition about relationships in the world. They describe the friendships between Facebook users, interactions in financial markets, and synapses connecting neurons in the brain. These networks are richly structured with cliques of friends, sectors of stocks, and a smorgasbord of cell types that go…
Combining logic and probability has been a long stand- ing goal of AI research. Markov Logic Networks (MLNs) achieve this by attaching weights to formulas in first-order logic, and can be seen as templates for constructing features for ground Markov networks. Most techniques for learning weights of MLNs are domain-size…
How can we correlate neural activity in the human brain as it responds to words, with behavioral data expressed as answers to questions about these same words? In short, we want to find latent variables, that explain both the brain activity, as well as the behavioral responses. We show that this is an instance of the C…
DeepRole learns to play hidden role games like Avalon.
problem Learning cooperation in uncertain multi-agent settings.
method Combines CFR and deep learning with deductive reasoning.
result DeepRole outperforms other agents and humans in Avalon.
The paper develops personalized DAG models for web user behavior.
problem Understanding user behavior transitions between websites with user heterogeneity and network dependency.
method Personalized Binomial DAG models with network-structured covariates, embedding network structure into a dimension-reduced covariate, learning node neighborhoods, and exploring variance-mean relation.
result The proposed algorithm outperforms state-of-the-art competitors in heterogeneous data.
On many social networking web sites such as Facebook and Twitter, resharing or reposting functionality allows users to share others' content with their own friends or followers. As content is reshared from user to user, large cascades of reshares can form. While a growing body of research has focused on analyzing and c…
EF21-Muon optimizes deep learning with error feedback, improving efficiency and accuracy.
problem Lack of principled distributed frameworks for non-Euclidean LMO-based optimizers.
method Introduces EF21-Muon, a communication-efficient, non-Euclidean LMO-based optimizer with convergence guarantees.
result First efficient distributed implementation of non-Euclidean LMO-based optimizers, achieving up to 7x communication savings.